POJ1962Corporative Network[带权并查集]

Corporative Network

Time Limit: 3000MS		Memory Limit: 30000K
Total Submissions: 3945		Accepted: 1416

Description

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.

Input

Your program has to be ready to solve more than one test case. The first line of the input 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 finishes 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

Source

Southeastern Europe 2004

---

维护d[i]为到父节点到距离，路径压缩时维护

//
//  main.cpp
//  poj1962
//
//  Created by Candy on 10/11/16.
//  Copyright © 2016 Candy. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=1e5+10;
typedef long long ll;
inline int read(){
    char c=getchar();int x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
int T,n,u,v;
char s[5];
int fa[N],d[N];
inline int find(int x){
    if(x!=fa[x]){
        int root=find(fa[x]);
        d[x]+=d[fa[x]];
        return fa[x]=root;
    }else return x;
}
int main(int argc, const char * argv[]) {
    T=read();
    while(T--){
        n=read();
        for(int i=1;i<=n;i++){fa[i]=i;d[i]=0;}
        while(true){
            scanf("%s",s);
            if(s[0]=='O') break;
            if(s[0]=='I'){
                u=read();v=read();
                fa[u]=v;
                d[u]=abs(u-v)%1000;
            }else{
                u=read();
                find(u);
                printf("%d
",d[u]);
            }
        }
    }
    
    return 0;
}