并查集
文章平均质量分 78
楚江枫
不忘初心,方得始终
展开
-
【HDU 杭电 畅通工程】
畅通工程Problem Description 某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路? Input 测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是城镇数目N ( < 1000 )和道路数原创 2016-08-13 23:52:47 · 379 阅读 · 0 评论 -
【Codeforces 741 B. Arpa's weak amphitheater and Mehrdad's 】+ 并查集 + 01背包
B. Arpa’s weak amphitheater and Mehrdad’s valuable Hoses time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputJust to remind, girls in Arp原创 2016-12-10 20:14:28 · 803 阅读 · 0 评论 -
【POJ 2236 Wireless Network】 + 并查集
Wireless Network Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 25271 Accepted: 10496Description An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical原创 2017-01-18 21:27:18 · 358 阅读 · 0 评论 -
【POJ 1611 The Suspects】+ 并查集
The Suspects Time Limit: 1000MS Memory Limit: 20000K Total Submissions: 35581 Accepted: 17269Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiol原创 2017-01-19 17:40:52 · 255 阅读 · 0 评论 -
【POJ 2524 Ubiquitous Religions】+ 并查集
Ubiquitous Religions Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 33063 Accepted: 16019Description There are so many different religions in the world today that it is diffi原创 2017-01-19 17:48:26 · 326 阅读 · 0 评论 -
【HDU 3038 How Many Answers Are Wrong】+ 并查集
How Many Answers Are Wrong Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6663 Accepted Submission(s): 2485Problem Description TT and FF原创 2017-01-19 22:13:30 · 396 阅读 · 0 评论 -
【Codeforces 722 C Destroying Array】+ 并查集
C. Destroying Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputYou are given an array consisting of n non-negative integers a1,原创 2017-02-10 16:05:57 · 409 阅读 · 0 评论 -
【POJ 1456 Supermarket】
Supermarket Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 12298 Accepted: 5452Description A supermarket has a set Prod of products on sale. It earns a profit px for each pro原创 2017-01-20 23:40:43 · 349 阅读 · 0 评论 -
【Codeforces 755 C PolandBall and Forest】+ 并查集
C. PolandBall and Forest time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputPolandBall lives in a forest with his family. There are some原创 2017-01-22 15:15:33 · 348 阅读 · 0 评论 -
【Codeforces 776 D The Door Problem】+ 并查集
D. The Door Problem time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Moriarty has trapped n people in n distinct rooms in a hotel. Some roo原创 2017-02-26 14:13:14 · 590 阅读 · 0 评论 -
【codeforces 445B - DZY Loves Chemistry 】 + 并查集
B. DZY Loves Chemistry time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputDZY loves chemistry, and he enjoys mixing chemicals.DZY has n原创 2016-10-27 00:13:13 · 450 阅读 · 0 评论 -
【POJ 1182 食物链】+ 并查集
食物链 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 65530 Accepted: 19319Description 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底原创 2016-11-04 20:54:26 · 341 阅读 · 0 评论 -
【poj 1703 Find them, Catch them + 并查集】
Find them, Catch themDescription The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the polic原创 2016-09-22 08:15:17 · 319 阅读 · 0 评论 -
【HDU 1213 How Many Tables】
How Many Tables Description Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all t原创 2016-08-14 16:48:15 · 331 阅读 · 0 评论 -
【HDU 1856 More is better 】
More is betterProblem Description Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requ原创 2016-08-14 17:21:15 · 312 阅读 · 0 评论 -
【POJ 1611 The Suspects】
The SuspectsDescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the原创 2016-08-14 17:29:39 · 272 阅读 · 0 评论 -
【HDU 1272 小希的迷宫】
小希的迷宫Problem Description 上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回原创 2016-08-14 19:07:39 · 334 阅读 · 0 评论 -
【HDU 2120 Ice_cream's world I】
Ice_cream’s world IProblem Description ice_cream’s world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers原创 2016-08-14 19:15:26 · 343 阅读 · 0 评论 -
【HDU 1325 Is It A Tree?】
Is It A Tree?Problem Description A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying原创 2016-08-14 19:25:58 · 313 阅读 · 0 评论 -
【HDU 4707 Pet】
PetProblem Description One day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use some cheese to trap the hamste原创 2016-08-14 19:35:11 · 536 阅读 · 0 评论 -
【HDU 5326 WORK】
WORKProblem DescriptionIt’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company. As is known to all, every stuff in a company has a title,原创 2016-08-14 19:42:48 · 320 阅读 · 0 评论 -
【HDU 1878 欧拉回路】
欧拉回路Problem Description 欧拉回路是指不令笔离开纸面,可画过图中每条边仅一次,且可以回到起点的一条回路。现给定一个图,问是否存在欧拉回路?Input 测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是节点数N ( 1 < N < 1000 )和边数M;随后的M行对应M条边,每行给出一对正整数,分别是该条边直接连通的两个节点的编号(节点从1到N编号)。当N为原创 2016-08-14 20:01:39 · 385 阅读 · 0 评论 -
【POJ 1988 Cube Stacking】+ 并查集
Cube Stacking Time Limit: 2000MSMemory Limit: 30000K Total Submissions: 25082Accepted: 8781 Case Time Limit: 1000MS Description Farmer John and Betsy are playing a game with N (1 <= N <= 30,000)id原创 2017-04-30 21:42:29 · 465 阅读 · 0 评论