Corporative Network UVA - 1329 加权并查集

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
// cout << "  ===  " << endl;

using namespace std;
typedef long long ll;
const int maxn = 20000 + 7, INF = 0x3f3f3f3f, mod = 1000; //1e9+7;
int T, n;
int f[maxn], d[maxn];

void update(int id) {
if(f[id] == id) return ;
update(f[id]);
d[id] = abs(id-f[id]) % mod + d[f[id]];
}

void solve() {
char c;
while(scanf("%c", &c)) {
if(c == 'O') return;
if(c == 'E') {
int id;
scanf("%d", &id); //st.insert(id);
update(id);
printf("%d\n", d[id]);
}
else if(c == 'I') {
int a_, b_;
scanf("%d %d", &a_, &b_);
f[a_] = b_;
d[a_] = abs(a_-b_) % mod;
}
}
}

int main() {
scanf("%d", &T);
while(T--) {
scanf("%d", &n);
for(int i = 0; i <= n; ++i)
f[i] = i, d[i] = 0;
solve();
}
return 0;
}