hdu 2818 Building Block【基础带权并查集】

Building Block

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

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
  
  

 

分析：题意为开始有N堆积木，每堆有1个积木，有操作：M x y 把x所在的那一堆积木搭在y所在的那一堆上；

         询问： C x ：x下面有多少积木。明显为带权并查集，开一个sum【maxh】用来存当前x所在对的积木

         数量，rank【maxh】存放x下有多少积木，则当find（x）!=find（y）时，rank【x】+=sum【b】，

         sum【b】+=sum【a】；分析完毕。

1. #include<stdio.h>
2. #include<string.h>
3. #include<algorithm>
4. #include<iostream>
5. #define maxh 30000+10
6. using namespace std;
7. int set[maxh],rank[maxh],sum[maxh];
8. void init()
9. {
10.     for(int i=0;i<=maxh;i++)
11.     {
12.         set[i]=i;
13.         rank[i]=0;
14.         sum[i]=1;
15.     }
16. }
17. int findx(int x)
18. {
19.     if(x==set[x])
20.     return set[x];
21.     int p=set[x];
22.     set[x]=findx(set[x]);
23.     rank[x]+=rank[p];
24.     return set[x];
25. }
26. void Union(int x,int y)
27. {
28.     int a=findx(x);
29.     int b=findx(y);
30.     if(a==b)
31.     return;
32.     set[a]=b;
33.     rank[a]=sum[b];
34.     sum[b]+=sum[a];
35.     return;
36. }
37. int main()
38. {   
39.     char c[3];
40.     int P,a,b;
41.     while(~scanf("%d",&P))
42.     {
43.         init();
44.         for(int i=0;i<P;i++)
45.         {
46.             scanf("%s",c);
47.             if(c[0]=='M')
48.             {
49.                 scanf("%d%d",&a,&b);
50.                 Union(a,b);
51.             }
52.             else
53.             {   
54.                 scanf("%d",&a);
55.                 findx(a);
56.                 printf("%d\n",rank[a]);
57.             }
58.         }
59.     }
60.     return 0;
61. }
62.         
63.