POJ1703-Find them, Catch them

这是一道类似于食物链的并查集题目。

#include <cstdio>

const int maxn = 10e5 + 10;

int par[2 * maxn];
int rk[2 * maxn];

void init(int n) {
    for (int i = 0; i < 2 * n; i++) {
        par[i] = i;
        rk[i] = 0;
    }
}

int find(int x) {
    if (par[x] == x)
        return x;
    else
        return par[x]  = find(par[x]);
}

void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y)
        return;
    if (rk[x] < rk[y]) {
        par[x] = y;
    } else {
        par[y] = x;
        if (rk[x] == rk[y])
            rk[x]++;
    }
}

bool same(int x, int y) {
    return find(x) == find(y);
}

int main(int argc, char const *argv[]) {
    int t;
    scanf("%d", &t);
    for (int i = 0; i < t; i++) {
        int n, m;
        scanf("%d%d", &n, &m);
        getchar();
        init(n);
        for (int j = 0; j < m; j++) {
            int ch = getchar();
            if (ch == 'D') {
                int x, y;
                scanf("%d%d", &x, &y);
                getchar();
                x--, y--;
                unite(x, y+n);
                unite(x+n, y);
            } else {
                int x, y;
                scanf("%d%d", &x, &y);
                getchar();
                x--, y--;
                if (same(x, y)) {
                    puts("In the same gang.");
                } else if (same(x, y+n)) {
                    puts("In different gangs.");
                } else {
                    puts("Not sure yet.");
                }
            }
        }
    }
    return 0;
}