并查集
Wang_SF2015
这个作者很懒,什么都没留下…
展开
-
文章标题 codeforces 115A:Party ( 并查集)
PartyDescriptionA company has n employees numbered from 1 to n. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An emplo原创 2016-08-18 15:50:20 · 359 阅读 · 0 评论 -
文章标题 POJ 1182 : 食物链 (带权并查集)
传送门 思路参考自 http://blog.csdn.net/niushuai666/article/details/6981689 代码:#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <queue>#include <set>#include <map>#includ转载 2017-08-07 17:54:02 · 103 阅读 · 0 评论 -
文章标题 POJ 1611 : The Suspects (并查集)
The SuspectsSevere 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 strat原创 2017-01-19 23:02:27 · 292 阅读 · 0 评论 -
文章标题 HDU 3172 : Virtual Friends (并查集+map)
Virtual FriendsThese days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, growing their social network (their friends, their原创 2017-01-19 22:51:29 · 335 阅读 · 0 评论 -
文章标题 HDU 1558 : Segment set (并查集+线段相交)
Segment setA segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of segments in it. The problem is to find the size of some segment set.原创 2017-01-19 22:27:38 · 307 阅读 · 0 评论 -
文章标题 coderforces 755C : PolandBall and Forest(并查集)
PolandBall and ForestPolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with k vertices and k - 1 edges, where k is some integer. Note原创 2017-01-16 13:29:30 · 493 阅读 · 0 评论 -
文章标题 POJ 2523 : Colored Sticks(字典树+并查集+欧拉路径)
Colored SticksDescription You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of原创 2016-11-13 21:01:23 · 416 阅读 · 0 评论 -
文章标题 HDU 4786 : Fibonacci Tree(最小生成树--kruskal+并查集)
Fibonacci TreeDescription Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decides to solve the following problem: Consi原创 2016-10-30 21:52:47 · 337 阅读 · 0 评论 -
文章标题 HDU 3371 : Connect the Cities(最小生成树--Kruskal+并查集)
Connect the CitiesDescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The gove原创 2016-10-30 21:08:45 · 384 阅读 · 0 评论 -
文章标题 POJ 2349:Arctic Network ( 最小生成树Kruskal算法+并查集)
Arctic NetworkDescriptionThe Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establish原创 2016-08-18 16:17:25 · 512 阅读 · 0 评论 -
文章标题 HDU 2874 : Connections between cities(LCA+并查集)
题目链接 题意:有n个点组成的森林,然后有c个询问,每次询问u->v有没有一条路径,有的话,输出这条路径的距离,没有的话输出“Not connected” 分析:首先,判断是否有路径到达,只需要用并查集,看一下两个点是否在同一颗树上,然后对于有路径的两个点,我们可以求他们的LCA,然后通过dis[u]+dis[v]-2*dis[lca]来得到答案,但是题目给的是森林不是树,可以用另一个点作为树根原创 2017-08-23 15:00:25 · 153 阅读 · 0 评论