hdu 3635 Dragon Balls

http://acm.hdu.edu.cn/showproblem.php?pid=3635

#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 20000
using namespace std;

int f[maxn];
int add[maxn];
int move1[maxn];
int n,Q,a1,b1;
char ch;

int find1(int x)
{
    if(x==f[x]) return x;
    int f1=find1(f[x]);
    move1[x]+=move1[f[x]];
    f[x]=f1;
    return f[x];
}

void union1(int a,int b)
{
    int fa=find1(a);
    int fb=find1(b);
    if(fa!=fb)
    {
        add[fb]+=add[fa];
        move1[fa]=1;
        f[fa]=fb;
    }
}

void inti()
{
    for(int i=1; i<=n; i++)
    {
        f[i]=i;
        add[i]=1;
    }
}

int main()
{
    int T;
    scanf("%d",&T);
    for(int ca=1; ca<=T; ca++)
    {
        scanf("%d%d",&n,&Q);
        inti();
        getchar();
        memset(move1,0,sizeof(move1));
        printf("Case %d:
",ca);
        for(int i=1; i<=Q; i++)
        {
            scanf("%c %d",&ch,&a1);
            if(ch=='T')
            {
                scanf("%d",&b1);
                union1(a1,b1);
            }
            else if(ch=='Q')
            {
                int c1=find1(a1);
                printf("%d %d %d
",c1,add[c1],move1[a1]);
            }
            getchar();
        }
    }
    return 0;
}