LA 3027 Corporative Network

这题感觉和 POJ 1988 Cube Stacking 很像，在路径压缩的同时递归出来的时候跟新distant数组

 我发现我一直WA的原因是，命令结束是以字母o结束的，而不是数字0！！

//#define LOCAL
#include <algorithm>
#include <cstdio>
using namespace std;

const int maxn = 20000 + 10;
int parent[maxn], distant[maxn];

int GetParent(int a)
{
    if(parent[a] == a)    return a;
    int root = GetParent(parent[a]);
    distant[a] += distant[parent[a]];
    return parent[a] = root;
}

int main(void)
{
    #ifdef LOCAL
        freopen("3027in.txt", "r", stdin);
    #endif

    int T, n;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d", &n);
        char cmd[9];
        for(int i = 1; i <= n; ++i)
        {
            parent[i] = i;
            distant[i] = 0;
        }
        while(scanf("%s", cmd) && cmd[0] != 'O')
        {
            int a, b;
            if(cmd[0] == 'E')
            {
                scanf("%d", &a);
                GetParent(a);
                printf("%d
", distant[a]);
            }
            else
            {
                scanf("%d%d", &a, &b);
                parent[a] = b;
                distant[a] = abs(a - b) % 1000;
            }
        }
    }
    return 0;
}