UVALive 3027 Corporative Network

给定两种操作

1.E I 查询I到根节点的距离

2.I I J 将I的父节点设为J，I，J的距离变为|I-J|%1000。

在查找结点的时候顺便把结点到根节点的距离更新。

代码：

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#define esp 1e-6
#define pb push_back
#define in  freopen("in.txt", "r", stdin);
#define out freopen("out.txt", "w", stdout);
#define print(a) printf("%d
",(a));
#define bug puts("********))))))");
#define Rep(i, c) for(__typeof(c.end()) i = c.begin(); i != c.end(); i++)
#define inf 0x0f0f0f0f
using namespace std;
typedef long long  LL;
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii,int> VII;
typedef vector<int>:: iterator IT;

#define N 22222
int pa[N],  dis[N];
void init(void)
{
    for(int i = 0; i < N; i++)
        pa[i] = i, dis[i] = 0;
}
inline int findset(int x)
{
    if(pa[x] == x)
    {
        return x;
    }
    else
    {
        int r = findset(pa[x]);
        dis[x] += dis[pa[x]];
        return pa[x] = r;
    }
}
int main(void)
{

    int T, n;
    for(int t = scanf("%d", &T); t <= T; t++)
    {
        init();
        scanf("%d", &n);
        char  op[10];
        while(scanf("%s", op) && op[0] != 'O')
        {
            int u, v;
            if(op[0] == 'E')
            {
                scanf("%d", &u);
                findset(u);
                printf("%d
", dis[u]);
            }
            else
            {
                scanf("%d%d", &u, &v);
                dis[u] = (int)fabs(u-v)%1000;
                pa[u] = v;
            }
        }
    }
    return 0;
}