![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
并查集
文章平均质量分 85
剑不飞
时刻思考,找准方向,坚定执行,永不服输(AC才是王道。)
展开
-
CF-25D - Roads not only in Berland(并查集或者搜索)
D - Roads not only in BerlandCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 25D DescriptionB原创 2013-02-02 21:55:59 · 686 阅读 · 0 评论 -
CF-60D - Savior(并查集+数论)
D - SaviorTime Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 60DDescriptionMisha decided to help Pasha and Akim be fri原创 2013-03-22 14:36:45 · 1081 阅读 · 0 评论 -
hdu 4514 湫湫系列故事——设计风景线(并查集)
湫湫系列故事——设计风景线Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 676 Accepted Submission(s): 219Problem Description 随着杭州西湖的知名度的进原创 2013-03-24 10:25:42 · 1184 阅读 · 3 评论 -
hdu 1856 More is better(并查集)
More is betterTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 8057 Accepted Submission(s): 3001Problem DescriptionMr Wang w原创 2013-03-03 20:27:35 · 390 阅读 · 0 评论 -
poj 1386 ZOJ 2016 Play on Words(并查集+欧拉通路)
Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7826 Accepted: 2759DescriptionSome of the secret doors contain a very interesting word pu原创 2013-03-02 10:38:16 · 513 阅读 · 0 评论 -
poj 1703 Find them, Catch them(并查集应用)
Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23593 Accepted: 7066DescriptionThe police office in Tadu City decides to say ends原创 2013-03-14 11:08:23 · 561 阅读 · 0 评论 -
poj 1079 Cube Stacking(并查集)
Cube StackingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 15705 Accepted: 5331Case Time Limit: 1000MSDescriptionFarmer John and Betsy are pla原创 2013-02-24 17:10:53 · 545 阅读 · 0 评论 -
poj 1182 食物链(并查集)
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33156 Accepted: 9626Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物原创 2013-03-05 13:18:29 · 651 阅读 · 0 评论 -
hdu 1598 find the most comfortable road(枚举+并查集)
find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1864 Accepted Submission(s): 779Problem Description原创 2013-03-03 21:14:52 · 420 阅读 · 0 评论 -
hdu 4424 Conquer a New Region(并查集,4级)
E - Conquer a New RegionTime Limit:4000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4424DescriptionThe wheel of the history rolling for原创 2013-10-05 17:07:44 · 590 阅读 · 0 评论