原題： 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|(mod1000). 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 first line of the input file 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
中文： 給你n個節點，初始每個節點的父節點都不存在。給你n條命令，其中 I u v 表示把節點u的父節點設置為v，u與v之間的距離為|v-v|%1000，輸入保證u沒有父節點 E u 表示輸出u到根節點的距離 輸入命令O表示結束
#include <bits/stdc++.h>using namespace std;int father[20001];int dis[20001];int n;int get_dis(int x){ if(father[x]!=x) { int f=get_dis(father[x]); dis[x]+=dis[father[x]]; father[x]=f; return f; } return father[x];}void ini(){ for(int i=1;i<=n;i++) father[i]=i; memset(dis,0,sizeof(dis));}int main(){ ios::sync_with_stdio(false); int t; cin>>t; while(t--) { cin>>n; ini(); string s; while(cin>>s) { if(s=="O") break; if(s=="E") { int res; cin>>res; get_dis(res); cout<<dis[res]<<endl; } if(s=="I") { int u,v; cin>>u>>v; father[u]=v; dis[u]=abs(u-v)%1000; } } } return 0;}思路： 訓練指南上并查集的第二道例題，此題如何解很好想。就是在并查集路徑壓縮的過程當中把距離累加起來即可，不過，若是對遞歸理解的不好，代碼如何寫會是一個很大的問題。
新聞熱點
疑難解答
