POJ2985 The k-th Largest Group(treap+并查集)

最新推荐文章于 2017-09-03 23:13:12 发布

HOrchard

最新推荐文章于 2017-09-03 23:13:12 发布

阅读量476

点赞数

分类专栏： treap树并查集

本文链接：https://blog.csdn.net/HOrchard/article/details/77380793

版权

该博客介绍了如何利用Treap和并查集数据结构解决POJ2985问题，即在一系列合并操作后，查询第k大的猫组大小。博客提供了输入输出示例，并详细解释了题目的意思。通过将每次合并操作映射到Treap中删除元素，然后使用并查集合并组，最终将合并结果重新插入Treap，可以有效地找到所需的答案。

摘要由CSDN通过智能技术生成

题目链接

Input

1st line: Two numbers N and M (1 ≤ N, M ≤ 200,000), namely the number of cats and the number of operations.

2nd to (m + 1)-th line: In each line, there is number C specifying the kind of operation Newman wants to do. If C = 0, then there are two numbers i and j (1 ≤ i, j ≤ n) following indicating Newman wants to combine the group containing the two cats (in case these two cats are in the same group, just do nothing); If C = 1, then there is only one number k