并查集
黑码
这个作者很懒,什么都没留下…
展开
-
codeforces 1332C K-Complete Word
K-Complete Wordtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputWord????sof length????nis called????k-complete if????sis a palindrome...原创 2020-04-01 14:32:04 · 418 阅读 · 1 评论 -
CodeForces - 731C Socks (并查集)
Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy’s clothes.T原创 2017-08-09 23:57:53 · 1550 阅读 · 0 评论 -
codeforces 445B DZY Loves Chemistry 贪心 dfs 并查集
DZY loves chemistry, and he enjoys mixing chemicals.DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in a原创 2017-08-09 23:53:40 · 498 阅读 · 0 评论 -
codeforeces 609E Minimum spanning tree for each edge MST +LCA
Connected undirected weighted graph without self-loops and multiple edges is given. Graph contains n vertices and m edges.For each edge (u, v) find the minimal possible weight of the spanning tree that原创 2017-06-15 01:16:43 · 437 阅读 · 0 评论 -
hdu 5438 Ponds 拓扑排序 + 并查集
Betty owns a lot of ponds, some of them are connected with other ponds by pipes, and there will not be more than one pipe between two ponds. Each pond has a value vv. Now Betty wants to remove some pon原创 2017-06-14 12:05:26 · 374 阅读 · 0 评论 -
历届试题 危险系数 (蓝桥,并查集,搜索)
问题描述 抗日战争时期,冀中平原的地道战曾发挥重要作用。地道的多个站点间有通道连接,形成了庞大的网络。但也有隐患,当敌人发现了某个站点后,其它站点间可能因此会失去联系。我们来定义一个危险系数DF(x,y):对于两个站点x和y (x != y), 如果能找到一个站点z,当z被敌人破坏后,x和y不连通,那么我们称z为关于x,y的关键点。相应的,对于任意一对站点x和y,危险系数DF(x,y)就表示为这两原创 2017-04-04 16:48:49 · 654 阅读 · 1 评论 -
codeforces Bear and Friendship Condition
Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).There are n members, numbered 1 through原创 2017-03-19 12:00:01 · 543 阅读 · 0 评论 -
Mahmoud and a Dictionary codeforces396 div2 D
D. Mahmoud and a Dictionary time limit per test4 seconds memory limit per test256 megabytes inputstandard input outputstandard output Mahmoud wants to write a new dictionary that contains n words原创 2017-02-08 18:30:22 · 493 阅读 · 0 评论 -
uva 11987 带删除的并查集
Initially, the collection contains n sets: {1}, {2}, {3}, … , {n}. Input There are several test cases. Each test case begins with a line containing two integers n and m (1 ≤ n, m ≤ 100, 000), the nu原创 2017-01-16 22:33:52 · 673 阅读 · 0 评论 -
hdu 2818 Building Blocks (并查集)
John are playing with blocks. There are N blocks (1 <= N <= 30000) numbered 1…N。Initially, there are N piles, and each pile contains one block. Then John do some operations P times (1 <= P <= 1000000).原创 2017-01-16 21:29:38 · 568 阅读 · 0 评论 -
codeforces 722c 用并查集求缺省的最大子序列
You are given an array consisting of n non-negative integers a1, a2, …, an.You are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from 1 to n definin原创 2017-01-16 20:55:44 · 444 阅读 · 0 评论 -
POJ 1182 食物链(带权并查集)
哈哈哈 第一天脑子疼没看懂,第二天一看,也就那么回事嘛。 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述: 第一种说法是”1 X Y”,表示X和Y是同类。 第二种说法是”2 X Y”,表示X原创 2016-12-09 16:16:44 · 403 阅读 · 0 评论 -
hdu 3038 日了狗的并查集
TT and FF are … friends. Uh… very very good friends -__-b FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write down a原创 2016-12-08 17:05:00 · 523 阅读 · 0 评论