OJ（1988）：Cube Stacking

最新推荐文章于 2022-02-20 12:04:32 发布

爱晒太阳的胖子

最新推荐文章于 2022-02-20 12:04:32 发布

阅读量160

点赞数

分类专栏：并查集

本文链接：https://blog.csdn.net/qq_42018521/article/details/81875372

版权

并查集专栏收录该内容

4 篇文章 0 订阅

订阅专栏

总时间限制:

2000ms

单个测试点时间限制:

1000ms

内存限制:

65536kB

描述

Farmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John asks Betsy to perform P (1<= P <= 100,000) operation. There are two types of operations:
moves and counts.
* In a move operation, Farmer John asks Bessie to move the stack containing cube X on top of the stack containing cube Y.
* In a count operation, Farmer John asks Bessie to count the number of cubes on the stack with cube X that are under the cube X and report that value.

Write a program that can verify the results of the game.

输入

* Line 1: A single integer, P

* Lines 2..P+1: Each of these lines describes a legal operation. Line 2 describes the first operation, etc. Each line begins with a 'M' for a move operation or a 'C' for a count operation. For move operations, the line also contains two integers: X and Y.For count operations, the line also contains a single integer: X.

Note that the value for N does not appear in the input file. No move operation will request a move a stack onto itself.

输出

Print the output from each of the count operations in the same order as the input file.

样例输入

样例输出

1
0
2

来源

USACO 2004 U S Open

除了parent数组，还要开设sum数组：记录每堆一共有多少方块。若parent[a] = a, 则sum[a]表示a所在的堆的方块数目。
under数组，under[i]表示第i个方块下面有多少个方块。under数组在堆合并和路径压缩的时候都要更新。

#include<iostream>
#include<cstdio>
#define maxn  31000

using namespace std;

int under[maxn];
int sum[maxn];
int f[maxn];

int getf(int a){
    if(f[a]==a)
        return a;
    int t = getf(f[a]); //保证到根节点的所有under值都更新（回溯方向考虑）
    under[a] += under[f[a]];
    f[a]=t;
    return f[a];
}
void Merge(int x,int y){
    int t1 = getf(x);
    int t2 = getf(y);
    f[t1] = t2;
    under[t1] = sum[t2];
    sum[t2] += sum[t1];
}
int main()
{
    int n;
    for(int i = 0;i < maxn;i++){
        under[i] = 0;
        f[i] = i;
        sum[i] = 1;
    }
    scanf("%d",&n);
    for(int i = 1;i <= n;i++){
        char s;
        int x,y;
        getchar();
        scanf("%c",&s);
        if(s == 'M'){
            scanf("%d%d",&x,&y);
            Merge(x,y);
        }
        else {
            scanf("%d",&x);
            getf(x);
            printf("%d\n",under[x]);
        }
    }
}