Corporative Network UVA - 1329 加权并查集（压缩路径优化）

比之上两篇博文，，这一篇是优化版
每次更新的时候 d [ i ] 表示 i 到根结点的距离，并且 f [ i ] 表示的不再是 i 的父节点，而是根结点，起到了压缩路径的目的
下次更新的时候更加快速

#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; 
int T, n, ans;
int f[maxn], d[maxn];

int update(int id) {
    if(f[id] == id) return id;
    int root = update(f[id]);
    d[id] += d[f[id]];
    return f[id] = root;
}

void solve() {
    char c;
    while(scanf("%c", &c)) {
        if(c == 'O') return;
        if(c == 'E') {
            int id;
            scanf("%d", &id); 
            ans = 0;
            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;
}