HDU 3635 Dragon Balls 带权并查集

还以为蛮高深的并查集呢，原来是个大水题，

n个城市n个球，m个查询，T表示把和x号求同样城市的球转移到y号球所在的城市，Q表示询问x号球在哪个城市，该城市有多少个球，x号球转移了几次

#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#define LL long long
#define eps 1e-8
#define INF 0x3f3f3f3f
#define OPEN_FILE
#define MAXN 10005
using namespace std;
int n, m;
int father[MAXN], step[MAXN], num[MAXN];
//step[x]表示x移动了多少次，num[x]表示x号城市有几个球
int find(int x){
    if (father[x] == x) return x;
    int y = father[x];
    father[x] = find(father[x]);
    step[x] += step[y];
    return father[x];
}

int main()
{
#ifdef OPEN_FILE
    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
#endif // OPEN_FILE
    int T;
    scanf("%d", &T);
    for (int cas = 1; cas <= T; cas++){
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i++){
            father[i] = i;
            step[i] = 0;
            num[i] = 1;
        }
        printf("Case %d:
", cas);
        char ch;
        int x, y;
        for (int i = 1; i <= m; i++){
            scanf("
");
            scanf("%c", &ch);
            if (ch == 'T'){
                scanf("%d%d", &x, &y);
                //把与x相同城市的所有球移到y所在城市
                int a = find(x), b = find(y);
                num[b] += num[a];
                num[a] = 0;
                step[a]++;
                father[a] = b;
            }
            if (ch == 'Q'){
                scanf("%d", &x);
                int a = find(x);
                printf("%d %d %d
", a, num[a], step[x]);
            }
        }
    }
}