hdu 3635 Dragon Balls 带权并查集

记录移动次数，其实每个根结点都是最多移动一次的，所以记录移动次数把自己的加上父亲结点的就是移动总数

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 10010;
int fa[maxn];
int num[maxn];
int Move[maxn];

int n;

void init()
{
    for (int i = 1; i <= n; i++)
    {
        fa[i] = -1;
        num[i] = 1;
        Move[i] = 0;
    }
}

int find(int x)
{
    if (fa[x] == -1)return x;
    int t = fa[x];
    fa[x] = find(fa[x]);
    Move[x] += Move[t];
    return fa[x];
}

void bing(int a, int b)
{
    int t1 = find(a);
    int t2 = find(b);
    if (t1 != t2)
    {
        fa[t1] = t2;
        num[t2] += num[t1];
        Move[t1] = 1;
    }
}

int main()
{
    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:
", 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
", t, num[t], Move[a]);
            }
        }
    }
    return 0;
}