并查集
文章平均质量分 79
Never_Say-Never
这个作者很懒,什么都没留下…
展开
-
hdoj1232
Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路? Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是城镇数目N ( < 100原创 2016-05-17 15:01:04 · 252 阅读 · 0 评论 -
hdoj2120Ice_cream's world I
Problem Descriptionice_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 are set up, and wa原创 2016-08-01 20:53:30 · 244 阅读 · 0 评论 -
hdoj1272小希的迷宫
Problem Description上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。原创 2016-08-01 20:48:20 · 179 阅读 · 0 评论 -
hdoj5631Rikka with Graph
Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:Yuta has a non-direct graph with原创 2016-08-01 20:40:27 · 218 阅读 · 0 评论 -
hdoj5326
Problem 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原创 2016-08-01 20:07:40 · 225 阅读 · 0 评论 -
hdoj1856
Problem DescriptionMr 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 requirements.原创 2016-08-01 13:21:36 · 211 阅读 · 0 评论 -
hdoj1213How Many Tables
Problem DescriptionToday 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 the frien原创 2016-08-01 13:12:16 · 269 阅读 · 0 评论 -
hdoj1611The Suspects
DescriptionSevere 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 best s原创 2016-08-01 13:05:41 · 292 阅读 · 0 评论 -
POJ2485Highways(Kruskal算法)
DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this probl原创 2016-08-04 11:26:42 · 264 阅读 · 0 评论 -
hdoj1863畅通工程(最小生成树模板题)
Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。 Input测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( <原创 2016-08-03 21:36:01 · 336 阅读 · 0 评论 -
POJ1287Networking(最小生成树,裸题)
DescriptionYou are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may con原创 2016-08-03 21:32:12 · 1880 阅读 · 1 评论 -
hodj1233还是畅通工程(最小生成树)
Problem Description某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当N为0时,输入结原创 2016-08-03 19:28:29 · 245 阅读 · 0 评论 -
POJ2377(最大生成树)
DescriptionBessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found原创 2016-08-03 19:25:57 · 528 阅读 · 0 评论 -
hdoj1878欧拉回路
Problem Description欧拉回路是指不令笔离开纸面,可画过图中每条边仅一次,且可以回到起点的一条回路。现给定一个图,问是否存在欧拉回路? Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是节点数N ( 1 束。 Output每个测试用例的输出占一行,若欧拉回路存在则输出1,否则输出0。 Sample原创 2016-08-01 21:00:38 · 422 阅读 · 1 评论