HDU 3635 Dragon Balls(并查集）

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
using namespace std;
const int MAXN = 10000 + 10;
int f[MAXN];
int Move[MAXN];
int num[MAXN];
int N, Q;
void init()
{
    for(int i=0;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 Union(int x, int y)
{
    int fx = find(x);
    int fy = find(y);
    if(fx != fy)
    {
        f[fx] = fy;
        num[fy] += num[fx];
        Move[fx] = 1;
    }
}
int main()
{

    int T, kcase = 1;
    scanf("%d", &T);
    while(T--)
    {

        scanf("%d%d", &N, &Q);
        init();
        printf("Case %d:\n", kcase++);
        int x, y;
        char ch[10];
        while(Q--)
        {
            scanf("%s", &ch);
            if(ch[0] == 'T')
            {
                scanf("%d%d", &x, &y);
                Union(x, y);
            }
            else
            {
                scanf("%d", &x);
                int t = find(x);
                printf("%d %d %d\n", t, num[t], Move[x]);
            }
        }
    }
    return 0;
}