随笔分类 -  ACM—并查集

1234: ZJTZYRC筛offer（并查集 ）
摘要：链接：http://xcacm.hfut.edu.cn/problem.php?id=1234 以后关于字符的输入都用cin吧，换成scanf居然wa了 阅读全文
posted @ 2016-05-07 20:06 御心飞行 阅读(335) 评论(0) 推荐(0)
The Suspects（POJ 1611 并查集）
摘要：The Suspects Time Limit: 1000MS Memory Limit: 20000K Total Submissions: 30158 Accepted: 14665 Description Severe acute respiratory syndrome (SARS), an 阅读全文
posted @ 2016-03-11 11:13 御心飞行 阅读(255) 评论(0) 推荐(0)
Travel(HDU 5441 2015长春区域赛 带权并查集)
摘要：Travel Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2404 Accepted Submission(s): 842 Problem 阅读全文
posted @ 2016-02-04 17:33 御心飞行 阅读(178) 评论(0) 推荐(0)
树上战争(HDU 2545 并查集求解点到根节点长度)
摘要：树上战争 Time Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 799 Accepted Submission(s): 436 Problem Des 阅读全文
posted @ 2016-02-04 14:57 御心飞行 阅读(394) 评论(0) 推荐(0)
More is better（hdu 1856 计算并查集集合中元素个数最多的集合）
摘要：More is better Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 21167 Accepted Submission(s): 77 阅读全文
posted @ 2016-02-04 12:38 御心飞行 阅读(194) 评论(0) 推荐(0)
How Many Tables(POJ 1213 求连通分量)
摘要：How Many Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20974 Accepted Submission(s): 103 阅读全文
posted @ 2016-02-04 11:46 御心飞行 阅读(218) 评论(0) 推荐(0)
Wireless Network(POJ 2236)
摘要：Wireless Network Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 20724 Accepted: 8711 Description An earthquake takes place in Southeast A 阅读全文
posted @ 2016-02-04 11:28 御心飞行 阅读(180) 评论(0) 推荐(0)
小希的迷宫（HDU 1272 并查集判断生成树）
摘要：小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38870 Accepted Submission(s): 11921 Problem 阅读全文
posted @ 2016-02-03 20:58 御心飞行 阅读(333) 评论(0) 推荐(0)
Find them, Catch them(POJ 1703 关系并查集)
摘要：Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 38668 Accepted: 11905 Description The police office in Tadu City deci 阅读全文
posted @ 2016-02-03 19:50 御心飞行 阅读(168) 评论(0) 推荐(0)
并查集 路径压缩
摘要：使用并查集查找时，如果查找次数很多，那么使用朴素版的查找方式肯定要超时。比如，有一百万个元素，每次都从第一百万个开始找，这样一次运算就是10^6，如果程序要求查找个一千万次，这样下来就是10^13,肯定要出问题的。 这是朴素查找的代码,适合数据量不大的情况： int findx(int x){ in 阅读全文
posted @ 2016-02-02 20:56 御心飞行 阅读(257) 评论(0) 推荐(0)
还是畅通工程（1233 并查集+kruskal）
摘要：还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34391Accepted Submission(s): 15542Problem De... 阅读全文
posted @ 2015-12-12 14:09 御心飞行 阅读(239) 评论(0) 推荐(0)
How Many Tables（并查集）
摘要：How Many TablesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17411Accepted Submission(s): 8527点我... 阅读全文
posted @ 2015-06-23 22:55 御心飞行 阅读(473) 评论(0) 推荐(0)
畅通工程（并查集）
摘要：畅通工程点我Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35908Accepted Submission(s): 19037Problem De... 阅读全文
posted @ 2015-06-23 22:29 御心飞行 阅读(213) 评论(0) 推荐(0)