
并查集
并查集
lwgkzl
海风和着歌声,星空伴着代码
展开
-
POJ1988 Cube Stacking(并查集)
Cube StackingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 24288 Accepted: 8512Case Time Limit: 1000MSDescriptionFarmer John and Betsy are pla原创 2016-12-11 20:29:49 · 428 阅读 · 0 评论 -
POJ 1733 Parity game(并查集巧解)
Parity gameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9400 Accepted: 3645DescriptionNow and then you play the following game with your friend. Yo原创 2017-08-09 11:37:46 · 483 阅读 · 0 评论 -
How Many Tables HDU - 1213 (并查集)
How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33080 Accepted Submission(s): 16514Problem DescriptionToday is原创 2017-08-08 09:49:56 · 459 阅读 · 0 评论 -
Farm Irrigation HDU - 1198 (并查集)
Farm IrrigationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10286 Accepted Submission(s): 4523Problem DescriptionBenny has原创 2017-08-08 09:34:39 · 297 阅读 · 0 评论 -
POJ 1611 The Suspects(并查集)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 41098 Accepted: 19838DescriptionSevere acute respiratory syndrome (SARS), an atypical pneu原创 2017-08-08 09:13:46 · 219 阅读 · 0 评论 -
HDU 3172 Virtual Friends()
Virtual FriendsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9392 Accepted Submission(s): 2729Problem DescriptionThese days原创 2017-08-08 09:10:44 · 264 阅读 · 0 评论 -
食物链 POJ1182(带权并查集)
食物链Time Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %lld & %lluSubmit StatusDescription动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。原创 2016-11-27 23:17:59 · 300 阅读 · 0 评论 -
The Suspects POJ1611(简单并查集)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionSevere acute respiratory syndrome (SARS), an atypical p原创 2016-11-27 16:49:51 · 387 阅读 · 0 评论 -
UVALive 3644 X-Plosives(简单并查集)
题目大意:把一些两个元素组成的化合物按输入次序往车上装,如果会发生爆炸(存在k个简单化合物,正好包含k种元素),记录,输出不能装车的化合物总数。做法:由于是其中K各简单化合物中包含K个元素,仔细一想就是并查集,把已经出现的点合成一个集合,对于新出现的两个值,如果两个值同时在一个集合中(注意可能不止一个集合),那么在这个集合中就肯定能找到另外几对数值使得他们与这一对数值构成一个环,如现在原创 2016-11-27 15:50:45 · 415 阅读 · 0 评论 -
POJ 1703 Find them, Catch them(关系并查集)
Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43097 Accepted: 13248DescriptionThe police office in Tadu City decides to say end原创 2016-12-14 22:29:43 · 315 阅读 · 0 评论 -
HDU 3047 Zjnu Stadium(带权并查集)
Zjnu StadiumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3967 Accepted Submission(s): 1515Problem DescriptionIn 12th Zheji原创 2017-08-09 11:41:37 · 261 阅读 · 0 评论