#include<bits/stdc++.h>
using namespace std;
const int _max = 2e4 + 10;
char cmd[2];
int n,a,b,pre[_max],d[_max];
void init(){
for(int i = 1; i <= n; ++ i){
pre[i] = i;//每个元素所在集合为其自身
d[i] = 0;//每个节点到父亲节点的距离为0
}
}
int find(int x){//返回元素x的根节点,路径压缩过程中维护d[]数组
if( x == pre[x]) return x;
int root = find(pre[x]);
d[x] += d[pre[x]];
return pre[x] = root;
}
void join(int a,int b){//并,按要求合并边(a,b)
pre[a] = b;
d[a] = (abs(a - b))%1000;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
#endif // ONLINE_JUDGE
int T;cin>>T;
while(T--){
scanf("%d",&n);
init();
while(scanf("%s",cmd) == 1 && cmd[0] != ‘O‘){
if(cmd[0] == ‘I‘){
scanf("%d%d",&a,&b);
join(a,b);
}
else{
scanf("%d",&a);
find(a);
printf("%d\n",d[a]);
}
}
}
return 0;
}
Ctrl + B
Ctrl + I
Ctrl + Q
Ctrl + L
Ctrl + K
Ctrl + G
Ctrl + H
Ctrl + O
Ctrl + U
Ctrl + R
Ctrl + Z
Ctrl + Y
版权声明:本文为博主原创文章,未经博主允许不得转载。
【并查集】UVALive3027 Corporative Network
原文地址:http://blog.csdn.net/u012717411/article/details/47999537