并查集
文章平均质量分 90
xuanweiace
一个热爱算法竞赛的弱校ACMer路过。青大本,浙大硕,方向后端开发,菜鸡一枚,奋斗ing...
展开
-
Mr. Kitayuta‘s Technology CodeForces - 505D(并查集+拓扑排序或dfs找环) 题解
题目Shuseki Kingdom is the world’s leading nation for innovation and technology. There are n cities in the kingdom, numbered from 1 to n.Thanks to Mr. Kitayuta’s research, it has finally become poss...原创 2020-12-15 23:35:33 · 538 阅读 · 1 评论 -
【CodeForces - 827A】String Reconstruction(并查集合并区间,思维)
题干:Ivan had stringsconsisting of small English letters. However, his friend Julia decided to make fun of him and hid the strings. Ivan preferred making a new string to finding the old one.Ivan ...原创 2019-10-25 13:28:56 · 819 阅读 · 0 评论 -
*【PAT天梯】分而治之(并查集,暴力)
题干:L2-1分而治之(25 分)分而治之,各个击破是兵家常用的策略之一。在战争中,我们希望首先攻下敌方的部分城市,使其剩余的城市变成孤立无援,然后再分头各个击破。为此参谋部提供了若干打击方案。本题就请你编写程序,判断每个方案的可行性。输入格式:输入在第一行给出两个正整数 N 和 M(均不超过10 000),分别为敌方城市个数(于是默认城市从 1 到 N 编号)和连接两城市的通...原创 2019-03-09 17:33:48 · 329 阅读 · 1 评论 -
【蓝桥杯官网试题 - 历届试题】发现环(dfs+并查集,或无向图tarjan判环,无向环,或拓扑排序)
题干:问题描述 小明的实验室有N台电脑,编号1~N。原本这N台电脑之间有N-1条数据链接相连,恰好构成一个树形网络。在树形网络上,任意两台电脑之间有唯一的路径相连。 不过在最近一次维护网络时,管理员误操作使得某两台电脑之间增加了一条数据链接,于是网络中出现了环路。环路上的电脑由于两两之间不再是只有一条路径,使得这些电脑上的数据传输出现了BUG。 为了恢复正常传输。小明需要找到所有...原创 2019-03-13 22:02:11 · 509 阅读 · 0 评论 -
【POJ - 1456】Supermarket (贪心,优先队列 或并查集)
题干:A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment ...原创 2019-03-02 19:13:00 · 652 阅读 · 0 评论 -
【牛客 - 373C】抓捕盗窃犯(连通图,思维,dfs 或 并查集)
题干:链接:https://ac.nowcoder.com/acm/contest/373/C来源:牛客网Q市发生了一起特大盗窃案。这起盗窃案是由多名盗窃犯联合实施的,你要做的就是尽可能多的抓捕盗窃犯。已知盗窃犯分布于NN个地点,以及第ii个地点初始有aiai名盗窃犯。特别的是,对于每一个地点uu,都有一个固定的地点vv--当前如果某个盗窃犯位于地点uu,...原创 2019-03-02 18:24:35 · 318 阅读 · 0 评论 -
【牛客 - 368D】动态连通块(并查集+bitset优化)
题干:小T有n个点,每个点可能是黑色的,可能是白色的。小T对这张图的定义了白连通块和黑连通块:白连通块:图中一个点集V,若满足所有点都是白点,并且V中任意两点都可以只经过V中的点互相到达,则称V中的点构成了一个白连通块。黑连通块:类似白连通块的定义。小T对这n个点m次操作。1、在两个点之间连一条边。2、询问白(黑)连通块个数。3、给出x,y两个点,保证同色(为了方便描述,x,...原创 2019-02-14 23:55:06 · 1422 阅读 · 0 评论 -
【HDU - 4056】Draw a Mess (并查集 or 线段树)
题干:It's graduated season, every students should leave something on the wall, so....they draw a lot of geometry shape with different color. When teacher come to see what happened, without getting an...原创 2018-12-24 09:15:34 · 295 阅读 · 0 评论 -
【CodeForces - 357C 】Knight Tournament(并查集 或 STLset)
题干:Hooray! Berl II, the king of Berland is making a knight tournament. The king has already sent the message to all knights in the kingdom and they in turn agreed to participate in this grand event....原创 2018-12-26 15:40:58 · 335 阅读 · 0 评论 -
【POJ - 2377】Bad Cowtractors (最大生成树,并查集)
题干:Bessie 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 M (1...原创 2018-11-24 12:18:27 · 262 阅读 · 0 评论 -
【牛客 - 157B】凤凰(树上并查集,dfs)
题干:链接:https://ac.nowcoder.com/acm/contest/157/B来源:牛客网题目描述传说,凤凰是百鸟之王。有一天,凤凰要召开百鸟大会,百鸟国是一个由n个节点组成的树,每个节点有一只鸟,开会的节点定在1号节点。每只鸟可以花费1s通过一条边,由于每根树枝(边)的载重有限,只允许一只鸟同时通过。作为会议的策划师,HtBest想知道百鸟国的所有鸟在1点集...原创 2019-03-20 13:40:15 · 368 阅读 · 0 评论 -
【CodeForces - 616C 】The Labyrinth点石成金(并查集,dfs)
题干:小O无意间发现了一张藏宝图,它跟随藏宝图的指引来到了一个宫殿,宫殿的地板被分成了n*m块格子,每个格子上放置了金子或者石头藏宝图告诉小O,它可以选择一块石头变成金子,并且带走与变化后的金子联通区域的所有金子(联通指的是上下左右,不能斜着)小O想计算一下点每个石头能带走的金子个数,帮帮他吧。输入:第一行两个数n,m (1 <= n,m <= 1000 )随后n行...原创 2019-03-18 16:49:10 · 343 阅读 · 0 评论 -
【Codeforces - 755C】PolandBall and Forest(并查集)
题干:PolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs withkvertices andk - 1edges, wherekis some integer. Note that one verte...原创 2019-10-10 20:27:38 · 220 阅读 · 0 评论 -
【CodeForces - 1131F 】Asya And Kittens(并查集,思维)
题干:Asya loves animals very much. Recently, she purchasednnkittens, enumerated them from11andnnand then put them into the cage. The cage consists of one row ofnncells, enumerated with integers...原创 2019-10-31 21:04:56 · 310 阅读 · 0 评论 -
【CodeForces - 722C】Destroying Array(并查集,时光倒流)
题干:给定一个有n个数的序列a1,a2, ..., an你每次可以将序列中一个数删去,剩下的数会被分割为一段一段连续的数列给定一个删除数的顺序,问在每次删除之后,剩下的连续的数列中,数列和的最大值为多少Input第一行输入仅有一个正整数n(1<=n<=100000)第二行包括n个整数a1,a2, ..., an(0<=ai<=1,000,000,00...原创 2019-10-09 20:24:05 · 223 阅读 · 0 评论 -
【CodeForces - 731C】Socks(并查集,思维)
题干:Arseniy is already grown-up and independent. His mother decided to leave him alone formdays and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clo...原创 2019-10-09 20:23:32 · 539 阅读 · 0 评论 -
【牛客 - 1080B】tokitsukaze and Hash Table(STLset,并查集,Hash)
题干:链接:https://ac.nowcoder.com/acm/contest/1080/B来源:牛客网tokitsukaze有n个数,需要按顺序把他们插入哈希表中,哈希表的位置为0到n-1。插入的规则是:刚开始哈希表是空的。对于一个数x,在哈希表中,如果(x mod n)的位置是空的,就把x放在(x mod n)的位置上。如果不是空的,就从(x mod n)往右开始找到...原创 2019-08-24 14:30:31 · 236 阅读 · 0 评论 -
【POJ - 3694】Network(对dfn求lca 或 缩点+lca 或 边双连通+并查集)
题干:网络管理员管理大型网络。该网络由N台计算机和成对计算机之间的M链路组成。任何一对计算机都通过连续的链接直接或间接连接,因此可以在任何两台计算机之间转换数据。管理员发现某些链接对网络至关重要,因为任何一个链接的故障都可能导致某些计算机之间无法转换数据。他把这种联系称为桥梁。他计划逐一添加一些新链接以消除所有桥梁。 您将通过在添加每个新链接后报告网络中的网桥数来帮助管理员。输入输入包...原创 2019-07-18 19:36:36 · 271 阅读 · 0 评论 -
【2019浙江省赛 - J】Welcome Party(并查集,bfs,优先队列,建图)
题干:The 44th World Finals of the International Collegiate Programming Contest (ICPC 2020) will be held in Moscow, Russia. To celebrate this annual event for the best competitive programmers around th...原创 2019-04-27 18:54:28 · 1250 阅读 · 0 评论 -
【CSU - 1004】Xi and Bo(并查集,裸题)
题干:Bo has been in Changsha for four years. However he spends most of his time staying his small dormitory. One day he decides to get out of the dormitory and see the beautiful city. So he asks to Xi...原创 2019-04-13 12:44:04 · 260 阅读 · 0 评论 -
【CodeForces - 278C 】Learning Languages(并查集,思维)
题干:The "BerCorp" company has got n employees. These employees can use m approved official languages for the formal correspondence. The languages are numbered with integers from 1 to m. For each empl...原创 2018-11-20 22:12:01 · 669 阅读 · 0 评论 -
【51Nod - 1163】最高的奖励 (贪心+优先队列 或 妙用并查集)
题干:有N个任务,每个任务有一个最晚结束时间以及一个对应的奖励。在结束时间之前完成该任务,就可以获得对应的奖励。完成每一个任务所需的时间都是1个单位时间。有时候完成所有任务是不可能的,因为时间上可能会有冲突,这需要你来取舍。求能够获得的最高奖励。Input第1行:一个数N,表示任务的数量(2 <= N <= 50000)第2 - N + 1行,每行2个数,中间用空格分隔...原创 2018-10-17 19:41:19 · 362 阅读 · 0 评论 -
【51Nod - 1416】两点 (dfs 或 并查集+dfs)
题干:福克斯在玩一款手机解迷游戏,这个游戏叫做”两点”。基础级别的时候是在一个n×m单元上玩的。像这样: 每一个单元有包含一个有色点。我们将用不同的大写字母来表示不同的颜色。这个游戏的关键是要找出一个包含同一颜色的环。看上图中4个蓝点,形成了一个环。一般的,我们将一个序列 d1,d2,...,dk 看成一个环,当且仅当它符合下列条件时:1. 这k个点不一样,即当 i≠j...原创 2018-10-17 19:18:03 · 252 阅读 · 0 评论 -
【HDU - 3038】How Many Answers Are Wrong (带权并查集--权为区间和)
题干:()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 ...原创 2018-07-20 08:37:59 · 274 阅读 · 0 评论 -
【CF#505B】Mr. Kitayuta's Colorful Graph (并查集或Floyd或BFS)
题干:Mr. Kitayuta has just bought an undirected graph consisting ofnvertices andmedges. The vertices of the graph are numbered from 1 ton. Each edge, namely edgei, has a colorci, connecting ver...原创 2019-03-25 21:57:42 · 238 阅读 · 0 评论 -
【CF566#D】 Restructuring Company (并查集---合并区间操作)
题干:Even the most successful company can go through a crisis period when you have to make a hard decision — to restructure, discard and merge departments, fire employees and do other unpleasant stuff...原创 2018-07-20 08:57:19 · 641 阅读 · 0 评论 -
*【HDU - 2473】Junk-Mail Filter (并查集--删点操作)
题干:Recognizing junk mails is a tough task. The method used here consists of two steps: 1) Extract the common characteristics from the incoming email. 2) Use a filter matching the set of common cha...原创 2018-07-16 23:43:33 · 381 阅读 · 0 评论 -
【POJ - 1287】 Networking (并查集 + 最小生成树)
题干:You 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 connect pairs...原创 2018-07-16 23:44:24 · 260 阅读 · 0 评论 -
【HDU - 1301】Jungle Roads(并查集+最小生成树)(内附最小生成树两种算法 克鲁斯特尔算法&&普里姆算法)
题干:Jungle RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5505 Accepted Submission(s): 3976Problem DescriptionThe Head Elder of...原创 2018-07-16 23:44:30 · 212 阅读 · 0 评论 -
【POJ - 1703】Find them, Catch them(带权并查集之--种类并查集 权为与父节点关系)
题干: Find them, Catch themTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 36176 Accepted: 11090 DescriptionThe ...原创 2018-07-20 00:11:52 · 451 阅读 · 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吃Y。 此人对N个动物,用上述两种说法,一句接一句地...原创 2018-07-19 22:38:44 · 2331 阅读 · 0 评论 -
【HDU - 3172】Virtual Friends(带权并查集--权为集合元素个数)
题干:These 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 friends' ...原创 2018-07-20 08:34:23 · 263 阅读 · 0 评论 -
*【CodeForces - 791B】Bear and Friendship Condition (图论,判断完全图,dfs乱搞或带权并查集)
题干: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 arenmembers, numbered1...原创 2018-09-15 15:53:24 · 300 阅读 · 0 评论 -
【HDU - 1272】小希的迷宫 (并查集判环)
题干:上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。小希现在把她的设计图给你,让你帮...原创 2018-08-31 23:02:02 · 218 阅读 · 0 评论 -
【POJ - 3310】Caterpillar(并查集判树+树的直径求树脊椎(bfs记录路径)+dfs判支链)
题干:An undirected graph is called a caterpillar if it is connected, has no cycles, and there is a path in the graph where every node is either on this path or a neighbor of a node on the path. This p...原创 2018-08-02 15:32:16 · 457 阅读 · 0 评论 -
【HDU - 1856】 More is better(并查集)(还需要空间优化。。)
题干: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 requirements. Mr Wang selected a ro...原创 2018-07-15 23:39:20 · 216 阅读 · 0 评论 -
【POJ - 1751】Highways (最小生成树)
题干:The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a...原创 2018-07-20 00:02:03 · 601 阅读 · 0 评论 -
【POJ - 2236】Wireless Network (并查集)
题干:An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in...原创 2018-07-19 23:04:08 · 219 阅读 · 0 评论 -
【HDU - 1863】 畅通工程(并查集+最小生成树)
题干:省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。 Input测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( < 100 );随后的 N 行对应村庄间...原创 2018-07-16 23:44:16 · 203 阅读 · 0 评论