HDOJ 2818 Building Block

最新推荐文章于 2018-02-09 23:08:32 发布

Anthony_azy

最新推荐文章于 2018-02-09 23:08:32 发布

阅读量311

点赞数

分类专栏： OJ

本文链接：https://blog.csdn.net/a2459956664/article/details/50351173

版权

OJ 专栏收录该内容

317 篇文章 1 订阅

订阅专栏

Building Block

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4222 Accepted Submission(s): 1316

Problem Description

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

Sample Output

#include <cstdio>
#include <cstring>
using namespace std;

int father[30005];
int rank[30005];
int maxNum[30005];

int find(int x){
    if (father[x] != x){
        int fa = father[x];
        father[x] = find(fa);
        rank[x] += rank[fa];
    }
    return father[x];
}

void Union(int x, int y){
    int fx = find(x);
    int fy = find(y);
    if (fx != fy){
        father[fx] = fy;
        rank[fx] += maxNum[fy] + 1;
        maxNum[fy] += maxNum[fx] + 1;
    }
}

int main(){
    int t;
    int x, y, i;
    char c;
    while (scanf("%d%*c", &t) != EOF){
        memset(rank, 0, sizeof(rank));
        memset(maxNum, 0, sizeof(maxNum));

        for (i = 0; i <= 30005; i++)
            father[i] = i;
        while (t--){
            c = getchar();
            if (c == 'M'){
                scanf("%d%d%*c", &x, &y);
                Union(x, y);
            }
            else{
                scanf("%d%*c", &x);
                find(x);
                printf("%d\n", rank[x]);
            }
        }
    }
    return 0;
}