并查集
关注
分享
扫一扫
zzcblogs
这个作者很懒，什么都没留下…
展开
-
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): 253 Accepted Submission(s): 120Pr原创 2017-04-29 19:05:18 · 229 阅读 · 0 评论 -
A Bug's Life （分组 并查集）
A Bug's LifeTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1087 Accepted Submission(s): 399Problem Descriptio原创 2017-04-25 19:19:15 · 277 阅读 · 0 评论 -
Is It A Tree? (并查集)
Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1173 Accepted Submission(s): 365Problem Descriptio原创 2017-04-25 21:20:16 · 773 阅读 · 0 评论 -
How Many Answers Are Wrong （带权的并查集）
How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 652 Accepted Submission(s): 293Proble原创 2017-04-29 20:49:20 · 274 阅读 · 0 评论 -
HDU 2818 Building Block （带权并查集）
Building BlockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 167 Accepted Submission(s): 74 Problem Description原创 2017-06-02 17:10:09 · 319 阅读 · 0 评论 -
Wireless Network （并查集）
Problem DescriptionAn 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,原创 2017-07-21 15:04:46 · 368 阅读 · 0 评论 -
POJ1703 Find them, Catch them （分类并查集）
Total Submission(s) : 10 Accepted Submission(s) : 3Problem DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city,原创 2017-07-21 16:57:00 · 242 阅读 · 0 评论