Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

2012-11-17 / B.cpp #1

Open
conopt opened this issue Oct 4, 2014 · 5 comments
Open

2012-11-17 / B.cpp #1

conopt opened this issue Oct 4, 2014 · 5 comments

Comments

@conopt
Copy link

conopt commented Oct 4, 2014

TvT 想不出来.. 只能这样骚扰..
@ftiasch
Copy link
Owner

ftiasch commented Oct 4, 2014

这是什么题？

@conopt
Copy link
Author

conopt commented Oct 4, 2014

500个点完全图 用最少的颜色给边染色 并且不出现奇数长度的环同色的方案

@ftiasch
Copy link
Owner

ftiasch commented Oct 4, 2014

考虑x, y两个点，如果x和y二进制的第i位不同，连一条颜色是i的边。

@conopt
Copy link
Author

conopt commented Oct 4, 2014

0.0 这样做最优性是怎么体现的...?

@ftiasch
Copy link
Owner

ftiasch commented Oct 4, 2014

orz 我也不会证……

@ftiasch ftiasch changed the title 啊...叉姐_(;3J <)_ 想问下 2012-11-17 / B.cpp 是什么想法... 2012-11-17 / B.cpp Oct 4, 2014
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@ftiasch @conopt