题目链接:
http://acm.uestc.edu.cn/#/problem/show/1070
题意:
题解:
带权并查集
每次往上更新的时候,顺便把边权更新了就好
记住得路径压缩
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 1e5+10;
int fa[maxn];
ll w[maxn];
int find(int x){
if(fa[x] == x) return x;
find(fa[x]);
w[x] += w[fa[x]];
fa[x] = find(fa[x]);
return fa[x];
}
void Union(int v,int u){
int t1 = find(v), t2 = find(u);
if(t1 == t2) return ;
fa[v] = t2;
w[v] = abs(u-v) % 1000 + w[u];
}
int main(){
int n=read();
for(int i=0; i<=n; i++){
fa[i] = i;
w[i] = 0;
}
char op;
while(scanf(" %c",&op) && op!='O'){
if(op=='I'){
int v,u; scanf("%d%d",&v,&u);
Union(v,u);
}else{
int x=read();
find(x);
printf("%lld\n",w[x]);
}
}
return 0;
}