UVALive 3027 Corporative Network 带权并查集

                     Corporative Network

A very big corporation is developing its corporative network. In the beginning each of the N enterprises
of the corporation, numerated from 1 to N, organized its own computing and telecommunication center.
Soon, for amelioration of the services, the corporation started to collect some enterprises in clusters,
each of them served by a single computing and telecommunication center as follow. The corporation
chose one of the existing centers I (serving the cluster A) and one of the enterprises J in some other
cluster B (not necessarily the center) and link them with telecommunication line. The length of the
line between the enterprises I and J is |I −J|(mod 1000). In such a way the two old clusters are joined
in a new cluster, served by the center of the old cluster B. Unfortunately after each join the sum of the
lengths of the lines linking an enterprise to its serving center could be changed and the end users would
like to know what is the new length. Write a program to keep trace of the changes in the organization
of the network that is able in each moment to answer the questions of the users.
Your program has to be ready to solve more than one test case.
Input
The ?rst line of the input ?le will contains only the number T of the test cases. Each test will start
with the number N of enterprises (5 ≤ N ≤ 20000). Then some number of lines (no more than 200000)
will follow with one of the commands:
E I — asking the length of the path from the enterprise I to its serving center in the moment;
I I J — informing that the serving center I is linked to the enterprise J.
The test case ?nishes with a line containing the word ‘O’. The ‘I’ commands are less than N.
Output
The output should contain as many lines as the number of ‘E’ commands in all test cases with a single
number each — the asked sum of length of lines connecting the corresponding enterprise with its serving
center.
Sample Input
1
4
E 3
I 3 1
E 3
I 1 2
E 3
I 2 4
E 3
O
Sample Output
0
2
3
5

题意：

　　有n个节点，初始时每个节点的父节点都不存在，你的任务是执行一次I操作和E操作，格式如下：
　　I u v：把节点u的父节点设为v，距离为|u-v|除以1000的余数。输入保证之星指令前没有父节点
　　E u：询问u到根节点的距离

题解：

　　带权并查集，存好与祖先的距离，注意覆盖值就好了

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5+10, M = 30005, mod = 1e9 + 7, inf = 0x3f3f3f3f;
typedef long long ll;
int f[N],d[N],T,n,a,b;
char ch[N];
int finds(int x) {
    if(f[x]!=x) {
        int root = finds(f[x]);
        d[x] += d[f[x]];
        return f[x] = root;
    }
    return x;
}
int main() {
    scanf("%d",&T);
    while(T--) {
        scanf("%d",&n);
        for(int i=1;i<=n;i++) f[i] = i;
        memset(d,0,sizeof(d));
        while(scanf("%s",ch)&&ch[0]!=‘O‘) {
            if(ch[0]==‘E‘) {
                scanf("%d",&a);
                int x = finds(a);
                printf("%d\n",d[a]);
            }
            else {
                scanf("%d%d",&a,&b);
                f[a] = b;
                d[a] += (abs(a-b)%1000);
            }
        }
    }
    return 0;
}