HDU 3635 Dragon bils (query set)

Dragon bils

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

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

His country has N cities and there are exactly N dragon bils 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) wocould be transported to other cities. to save physical strength WuKong plans to take Flying Nimbus Cloud, a magical flying cloud to gather dragon bils.
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 bils are there in that city, you also need to tell him how many times the ball has been transported so far.

 

InputThe first line of the input is a single positive integer T (0 <= 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 bils 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 Ballin Xth city) and Z (the tranporting times of the Ath ball ). (1 <= A, B <= N)

 

OutputFor 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 Input2 3 3 T 1 2 T 3 2 Q 2 3 4 T 1 2 Q 1 T 1 3 Q 1

 

Sample OutputCase 1: 2 3 0 Case 2: 2 2 1 3 3 2

 

Authorpossessor WC

 

ACM-ICPC Multi-University Training Contest (19) -- Host by HDU

 

Recommendlcy A question... It is abuse to think of and check the set. It mainly records the number of moves. In fact, each root node is moved at most once, so the number of moves recorded adds itself to the total number of moves on the parent node.

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;const int MAXN=10010;int F[MAXN];int num[MAXN];int move[MAXN];int n;void init(){    for(int i=1;i<=n;i++)    {        F[i]=-1;        num[i]=1;        move[i]=0;    }}int find(int x){    if(F[x]==-1)return x;    int t=F[x];    F[x]=find(F[x]);    move[x]+=move[t];    return F[x];}void bing(int a,int b){    int t1=find(a);    int t2=find(b);    if(t1!=t2)    {        F[t1]=t2;        num[t2]+=num[t1];        move[t1]=1;    }}int main(){   // freopen("in.txt","r",stdin);   // freopen("out.txt","w",stdout);    int m;    int T;    char str[10];    int a,b;    int iCase=0;    scanf("%d",&T);    while(T--)    {        iCase++;        scanf("%d%d",&n,&m);        init();        printf("Case %d:\n",iCase);        while(m--)        {            scanf("%s",&str);            if(str[0]=='T')            {                scanf("%d%d",&a,&b);                bing(a,b);            }            else            {                scanf("%d",&a);                int t=find(a);                printf("%d %d %d\n",t,num[t],move[a]);            }        }    }    return 0;}