
图论
文章平均质量分 83
Zeny_L
:-
展开
-
UVA 10596 (13.07.11)
Problem HMorning WalkTime Limit3 Seconds Kamalis a Motashotaguy. He has got a new job in Chittagong.So, he has moved to Chittagong fromDinajpur. He was getting fatter原创 2013-07-12 17:00:45 · 705 阅读 · 0 评论 -
HDU 1232 (简单并查集 查连通分支 13.10.30)
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24266 Accepted Submission(s): 12597Problem Description某省调查城镇交通状况,得到现有城镇道路原创 2013-10-31 00:26:55 · 1244 阅读 · 0 评论 -
HDU 2063 (二分图匹配问题 匈牙利算法 13.11.05)
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8064 Accepted Submission(s): 3533Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可以原创 2013-11-06 00:16:19 · 1196 阅读 · 0 评论 -
HDU 1233 (最小生成树 13.11.15)
还是畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21285 Accepted Submission(s): 9479Problem Description某省调查乡村交通状况,得到的统计表中原创 2013-11-15 23:56:18 · 1107 阅读 · 0 评论 -
HDU 2544 (带权值的最短路 13.11.16)
Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗? Input输入包括多组数据。每组数据第一行是两个整数N、M(N输入保证至少存在1条商店到赛场的路线。 O原创 2013-11-16 23:49:17 · 807 阅读 · 0 评论 -
HDU 1874 (畅通工程 Dij算法 13.11.16)
畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21689 Accepted Submission(s): 7554Problem Description某省自从实行了很多年的畅通工程计划后,终于修建原创 2013-11-17 00:16:48 · 1059 阅读 · 0 评论 -
HDU 1528 (二分图最大匹配 + 最小覆盖, 14.07.17)
Problem DescriptionAdam and Eve play a card game using a regular deck of 52 cards. The rules are simple. The players sit on opposite sides of a table, facing each other. Each player gets k cards f原创 2014-07-17 16:33:39 · 876 阅读 · 0 评论 -
UVA 11387 (14.2.28)
IIU C ONLINE C ON TEST 2 008Problem C: The 3-Regular GraphInput: standard inputOutput: standard output The degree of a vertex in a graph is the num原创 2014-02-28 20:05:53 · 819 阅读 · 0 评论 -
HDU 网络赛(杭州赛区)1003 (13.09.15)
Problem DescriptionThere was no donkey in the province of Gui Zhou, China. A trouble maker shipped one and put it in the forest which could be considered as an N×N grid. The coordinates of the up-le原创 2013-09-16 14:20:36 · 1261 阅读 · 0 评论 -
UVA 10004 (13.07.09)
Bicoloring In 1976 the ``Four Color Map Theorem" was proven with the assistance of acomputer. This theorem states that every map can be colored using only fourcolors, in such a way that no原创 2013-07-12 16:27:30 · 719 阅读 · 0 评论 -
UVA 10054 (13.07.11)
Problem D: The Necklace My little sister had a beautiful necklace made of colorful beads. Twosuccessive beads in the necklace shared a common color at their meeting point.The figure below原创 2013-07-12 19:21:38 · 692 阅读 · 0 评论 -
UVA 10129 (图论 欧拉回路 13.07.11)
Play on WordsSome of the secret doorscontain a very interesting word puzzle. The team of archaeologists has tosolve it to open that doors. Because there is no other way to open the doors,the puzzle原创 2013-07-12 19:28:44 · 828 阅读 · 0 评论