HDOJ 2818 Building Block （带权并查集）

BuildingBlock

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

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 Johndo some operations P times (1 <= P <= 1000000). There are two kinds ofoperation:

M X Y : Put the whole pile containing block X up to the pile containing Y. If Xand 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 containsinteger P. Then P lines follow, each of which contain an operation describeabove.

 

 

Output

Output the count for each Coperations in one line.

 

 

Sample Input

6

M 1 6

C 1

M 2 4

M 2 6

C 3

C 4

 

 

Sample Output

1

0

2

#include <bits/stdc++.h>
using namespace std;
#define mst(a,b) memset((a),(b),sizeof(a))
#define f(i,a,b) for(int i=(a);i<(b);++i)
const int maxn = 30005;
const int mod = 200907;
#define ll long long
#define rush() int t;scanf("%d",&t);while(t--)
int pre[maxn],under[maxn],num[maxn];
void init()
{
    f(i,0,maxn)
    {
        pre[i]=i;
        under[i]=0;
        num[i]=1;
    }
}
int find(int x)
{
    if(pre[x]==x)
        return x;
    else
    {
        int t=find(pre[x]);
        under[x]+=under[pre[x]];
        pre[x]=t;
        return t;
    }
}
void join(int x,int y)
{
    int a=find(x);
    int b=find(y);
    if(a!=b)
    {
        under[a]=num[b];
        num[b]+=num[a];
        //num[a]+=num[b];
        pre[a]=b;
    }
}
int main()
{
    int p;
    char s[3];
    int a,b;
    while(~scanf("%d",&p))
    {
        init();
        while(p--)
        {
            scanf("%s",s);
            if(s[0]=='M')
            {
                scanf("%d%d",&a,&b);
                join(a,b);
            }
            else
            {
                scanf("%d",&a);
                find(a);
                printf("%d\n",under[a]);
            }
        }
    }
    return 0;
}