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

Recommend

lcy   |   We have carefully selected several similar problems for you:  3172 1856 3234 3639 3633 

路徑壓縮加維護根節點，次數即為每個節點到根節點的距離

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 10005
int father[maxn];
int dis[maxn];
int num[maxn];
using namespace std;
int find(int x)
{
    if(x==father[x])
    return x;
    int root=find(father[x]);
    dis[x]+=dis[father[x]];
    return father[x]=root;

}
void unionn(int x,int y)
{
    int fa=find(x);
    int fb=find(y);
    if(fa!=fb)
    {
        father[fa]=fb;
        num[fb]+=num[fa];
        dis[fa]++;
    }
}
int main()
{
    int t;
    scanf("%d",&t);

        for(int i=1;i<=t;i++)
        {printf("Case %d:\n",i);
        int n,q;
        scanf("%d%d",&n,&q);
        for(int i=0;i<=n;i++)
        {
            father[i]=i;
            num[i]=1;
            dis[i]=0;
        }
        char op[20];
        while(q--)
        {
            scanf("%s",op);
            if(op[0]=='T')
            {
            int u,v;
            scanf("%d%d",&u,&v);
            unionn(u,v);
            }
            else if(op[0]=='Q')
            {
                int u;
                scanf("%d",&u);
                int root=find(u);
                printf("%d %d %d\n",root,num[root],dis[u]);
            }
        }
    }
    return 0;
}