随笔分类 - 图论--平面图及其着色问题
摘要:Vertex Cover frog has a graph with \(n\) vertices \(v(1), v(2), \dots, v(n)\) and \(m\) edges \((v(a_1), v(b_1)), (v(a_2), v(b_2)), \dots, (v(a_m), v(
阅读全文
摘要:Cell Phone Network Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6781 Accepted: 2429 Description Farmer John has decided to give each of
阅读全文
摘要:UOFTCG - Office Mates no tags no tags Dr. Baws has an interesting problem. His N Dr. Baws has an interesting problem. His N graduate students, while f
阅读全文
摘要:Reordering the Cows 时间限制: 1 Sec 内存限制: 64 MB提交: 18 解决: 7[提交][状态][讨论版] 题目描述 Farmer John's N cows (1 <= N <= 100), conveniently numbered 1..N, are standi
阅读全文
摘要:Arpa's loud Owf and Mehrdad's evil plan time limit per test 1 second time limit per test memory limit per test 256 megabytes memory limit per test inp
阅读全文
摘要:Map Coloring Time limit: 1.0 secondMemory limit: 64 MB We consider a geographical map with N countries numbered from 1 to N (0 < N < 99). For every co
阅读全文
摘要:Travelling Tours Time limit: 1.0 secondMemory limit: 64 MB There are N cities numbered from 1 to N (1 ≤ N ≤ 200) and M two-way roads connect them. The
阅读全文
摘要:1227. Rally Championship Time limit: 1.0 secondMemory limit: 64 MB A high-level international rally championship is about to be held. The rules of the
阅读全文
摘要:Graph Coloring Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4926 Accepted: 2289 Special Judge Description You are to write a program tha
阅读全文
摘要:That Nice Euler Circuit Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 1977 Accepted: 626 Description Little Joey invented a scrabble mach
阅读全文
摘要:Two Teams Time limit: 1.0 secondMemory limit: 64 MB The group of people consists of N members. Every member has one or more friends in the group. You
阅读全文