并查集模板 hdu1703

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>

using namespace std;

const int maxn = 2e5 + 10;

int n, m;
int s[maxn];
int h[maxn];

void init_set()
{
    for(int i = 0 ; i <= 2*n ; i++){///caution 
        s[i] = i;
        h[i] = 0;
    }
}

int find(int x)
{
    int now = x;
    while(now != s[now])    now = s[now];//find root
    int i = x;
    int j;
    while(i != now){
        j = s[i];//j作为临时变量存储父亲 
        s[i] = now;
        i = j;//父亲变儿子,再找爷爷... 
    }
    return now;
}

void union_set(int a, int b)
{
    int p = find(a);
    int q = find(b);
    if(p == q)    return ;
    
    if(h[p] == h[q]){
        h[p] += 1;
        s[q] = p;
    }else{
        if(h[p] < h[q])    s[p] = q;
        else    s[q] = p;
    }
}

int main(){
    int T; cin >> T;
    while(T--){
        scanf("%d%d",&n,&m);
        init_set();
        
        for(int i = 1 ; i <= m ; i++){
            //char ch;
            int a, b;
            //scanf("
%c%d%d", &ch, &a, &b);
            /* 
            if(ch == 'D'){                
                union_set(a + n, b);
                union_set(a, b + n);
            }else{
                if(find(a) == find(b) || find(a + n) == find(b + n)){
                    cout << "In the same gang." << endl;
                }else if(find(a + n) == find(b) || find(b + n) == find(a)){
                    cout << "In different gangs." << endl;            
                }else{
                    cout << "Not sure yet." << endl;
                }
            }*/ 
        }
        
    }

    return 0;
}

注意点数字！ 2e5之神