hdu 2818 Building Block

Building Block

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

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

  
  

   
   6
M 1 6
C 1
M 2 4
M 2 6
C 3
C 4
  
  

 

Sample Output

  
  

   
   1
0
2
  
  

 

Source

2009 Multi-University Training Contest 1 - Host by TJU


题意是将n个物品分为n堆，进行操作：
M X Y：将含X的那堆放到Y上面   ，如果他们在一堆，就不操作
C X：查询X一下有几个物品
很好的并查集题目。。
代码：

#include<stdio.h>
#include<string.h>
const int maxn=300005;
int a[maxn],b[maxn];
int f[maxn];
int find(int x)
{
   int t;
   if(x!=f[x])
   {
       t=find(f[x]);
       b[x]+=b[f[x]];
       f[x]=t;
   }
   return f[x];
}
void make(int x,int y)
{
    int f1=find(x);
    int f2=find(y);
    if(f1!=f2)
    {
        b[f1]=a[f2];
        a[f2]+=a[f1];
        f[f1]=f2;
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        memset(b,0,sizeof(b));
        for(int i=0;i<=n;i++)
        {
            f[i]=i;
            a[i]=1;
        }
        while(n--)
        {
            char s[2];
            int x,y;
            scanf("%s",s);
            if(s[0]=='M')
            {
                scanf("%d %d",&x,&y);
                make(x,y);
            }
            else
            {
                scanf("%d",&x);
                find(x);
                printf("%d\n",b[x]);
            }
        }
    }
    return 0;
}