题意:有n个节点,然后执行I u,v(把u的父节点设为v)和E u(询问u到根节点的距离)。
思路:并查集。加了信息的并查集,在路径压缩的同时维护距离d[i];
code:
#include <bits/stdc++.h>
using namespace std;
const int N=2e4+5;
int fa[N],d[N];
int getfa(int x)
{
if (x!=fa[x]){
int rt=getfa(fa[x]);
d[x]+=d[fa[x]];
fa[x]=rt;
}
return fa[x];
}
int main()
{
int T;
scanf("%d",&T);
while (T--){
int n,u,v;
char cmd[9];
scanf("%d",&n);
for (int i=0;i<n;i++) fa[i]=i,d[i]=0;
while (scanf("%s",cmd)&&cmd[0]!='O'){
if (cmd[0]=='E') {scanf("%d",&u);getfa(u);printf("%d\n",d[u]);}
else {scanf("%d %d",&u,&v);fa[u]=v;d[u]=abs(u-v)%1000;}
}
}
}