![](https://img-blog.csdnimg.cn/20190918140053667.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
染色法
文章平均质量分 88
染色法
_sky123_
这个作者很懒,什么都没留下…
展开
-
2020ICPC济南 J.Tree Constructer
题目链接题目描述MianKing has a Graph Constructer : The input of it is a sequence a1...n (0≤ai<260)a_{1...n}~(0\leq a_i<2^{60})a1...n (0≤ai<260) and the output of it is an undirected graph with nnn nodes, edge (x,y)(x,y)(x,y) is in this graph原创 2021-01-02 19:32:53 · 472 阅读 · 0 评论 -
Educational Codeforces Round 87 (Rated for Div. 2) E.Graph Coloring
You are given an undirected graph without self-loops or multiple edges which consists of n vertices and m edges. Also you are given three integers n1n_1n1, n2n_2n2 and n3n_3n3.Can you label each vertex with one of three numbers 1, 2 or 3 in such way, t原创 2020-05-18 21:37:38 · 320 阅读 · 0 评论