带权并查集-Building Block

最新推荐文章于 2025-06-12 23:06:45 发布

每天学点

最新推荐文章于 2025-06-12 23:06:45 发布

阅读量513

点赞数 2

CC 4.0 BY-SA版权

分类专栏： C/C++/Python/Java/Matlab

请勿用于任何商业用途；转载的话请加上我的地址；

本文链接：https://blog.youkuaiyun.com/qq_40828914/article/details/81590848

C/C++/Python/Java/Matlab 同时被 2 个专栏收录

291 篇文章 ¥39.90 ¥99.00

订阅专栏

C/C++

217 篇文章

订阅专栏

这篇博客探讨了带权并查集这一数据结构，通过一个涉及堆操作和计数的问题进行分析。博主分享了解决思路，将问题比作串鱼蛋的过程，并详细解释了如何移动和更新鱼蛋下面的计数。文章强调了在处理询问时使用find函数的重要性，以确保正确更新中间节点的计数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

John are playing with blocks. There are N blocks (1 <= N <= 30000) numbered 1…N。Initially, there are N piles, and each pile contains one block. Then John do some operations P times (1 <= P <= 1000000). There are two kinds of operation:

M X Y : Put the whole pile containing block X up to the pile containing Y. If X and Y are in the same pile, just ignore this command.
C X : Count the number of blocks under block X

You are request to find out the output for each C operation.
Input
The first line contains integer P. Then P lines follow, each of which contain an operation describe above.
Output
Output the count for each C operations in one line.
Sample Input
6
M 1 6
C 1
M 2 4
M 2 6