hdu 3635 Dragon Balls (带权并查集)

Dragon Balls

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

Problem Description

Five hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gather all of the dragon balls together. 

His country has N cities and there are exactly N dragon balls in the world. At first, for the ith dragon ball, the sacred dragon will puts it in the ith city. Through long years, some cities' dragon ball(s) would be transported to other cities. To save physical strength WuKong plans to take Flying Nimbus Cloud, a magical flying cloud to gather dragon balls. 
Every time WuKong will collect the information of one dragon ball, he will ask you the information of that ball. You must tell him which city the ball is located and how many dragon balls are there in that city, you also need to tell him how many times the ball has been transported so far.

 

Input

The first line of the input is a single positive integer T(0 < T <= 100). 
For each case, the first line contains two integers: N and Q (2 < N <= 10000 , 2 < Q <= 10000).
Each of the following Q lines contains either a fact or a question as the follow format:
  T A B : All the dragon balls which are in the same city with A have been transported to the city the Bth ball in. You can assume that the two cities are different.
  Q A : WuKong want to know X (the id of the city Ath ball is in), Y (the count of balls in Xth city) and Z (the tranporting times of the Ath ball). (1 <= A, B <= N)

 

Output

For each test case, output the test case number formated as sample output. Then for each query, output a line with three integers X Y Z saparated by a blank space.

 

Sample Input

2

3 3

T 1 2 T 3 2 Q 2 3 4 T 1 2 Q 1 T 1 3 Q 1

 

Sample Output

Case 1: 2 3 0 Case 2: 2 2 1 3 3 2

 

Author

possessor WC

 

Source

2010 ACM-ICPC Multi-University Training Contest（19）——Host by HDU

 

 题意：

      每一个城市都有一颗龙珠，但是随着时间的推移，龙珠会被移到其他的城市，悟空想去收集这些龙珠，但是他需要你告知他，他要找的那颗龙珠的所在的城市，以及这个城市所拥有的龙珠数量，还有这颗龙珠迁移过多少次。

代码：

#define LOCAL
#include<cstring>
#include<cstdio>
#define maxn 10005
/*
    (1) 第i求所在的城市x  city[];
    (2)    x城市所拥有的球数量 ball[];
    (3)    i球被转移的次数     cnt[];
*/
int ball[maxn];
int city[maxn];
int cnt[maxn];
int n,q;
 void init(){
   for(int i=1 ; i<=n ;i++ ){
         city[i]=i;
         ball[i]=1;
         cnt[i]=0; //转移次数
   }
 }

//搜索该龙珠所在城市的位置
int  fin(int x)
{
    //int tem;
    if(x==city[x])
      return city[x];
    int tem=city[x];
    city[x]=fin(city[x]);
    cnt[x]+=cnt[tem];
    return  city[x];
}

void Union(int x,int y)
{
    /*
      将 x城市的所有龙珠转移到y城市中
    */
    x=fin(x);
    y=fin(y);
   if(x!=y){
       city[x]=city[y];
    ball[y]+=ball[x];
    ball[x]=0;  //球全部移动到y城市中
    cnt[x]=1;  //第一次移动
   }
}

int main()
{

  int t,a,b,tt=0;
  char str[2];
  scanf("%d",&t);
  while(t--){
   scanf("%d%d",&n,&q);
   init();
   printf("Case %d:
",++tt);
   while(q--){
         scanf("%s",str);
         if(str[0]=='T'){
          scanf("%d%d",&a,&b);
          Union(a,b);
      }
      else
      {
          scanf("%d",&a);
            b=fin(a);
            printf("%d %d %d
",b,ball[b],cnt[a]);
      }
   }
  }
  return 0;
}