![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
并查集
pupil_blue
这个作者很懒,什么都没留下…
展开
-
HDOJ-----3635带权并查集
Five hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gather all of the dragon balls together.His country has N citi原创 2016-03-24 22:54:44 · 211 阅读 · 0 评论 -
POJ1308-----并查集基础题
DescriptionA 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 the following proper原创 2016-03-08 20:29:39 · 212 阅读 · 0 评论 -
HDOJ-----1878并查集+欧拉回路
欧拉回路Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12769 Accepted Submission(s): 4749Problem Description欧拉回路是指不令笔离开纸面,可画过图中每条边仅一原创 2016-08-01 21:00:22 · 308 阅读 · 0 评论 -
HDOJ-----5326
Work Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1709 Accepted Submission(s): 1026Problem DescriptionIt’s an interest原创 2016-08-01 20:54:03 · 171 阅读 · 0 评论 -
HDOJ-----1856
More is betterTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 24376 Accepted Submission(s): 8752Problem DescriptionMr Wang want原创 2016-08-01 20:23:25 · 206 阅读 · 0 评论 -
HDOJ-----5631并查集
Rikka with GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1042 Accepted Submission(s): 501Problem DescriptionAs we know, Ri原创 2016-08-01 20:14:55 · 268 阅读 · 0 评论 -
POJ1611-----并查集简单题
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 30098 Accepted: 14643DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumoni原创 2016-03-05 00:55:58 · 368 阅读 · 0 评论 -
并查集基础-----HDOJ1272-----小希的迷宫
Problem Description上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。原创 2016-01-05 11:14:24 · 291 阅读 · 0 评论 -
HDOJ-----1232并查集
Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路?原创 2016-01-04 18:14:26 · 265 阅读 · 0 评论 -
HDOJ-----3938---Portal并查集
ZLGG found a magic theory that the bigger banana the bigger banana peel .This important theory can help him make a portal in our universal. Unfortunately, making a pair of portals will cost min{T} ene原创 2016-11-14 12:12:09 · 398 阅读 · 0 评论