Submission #8246306

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

struct UnionFind{
private:
    vector<int> par, rank;
public:
    inline UnionFind(size_t sz){ init(sz); }
    inline void init(size_t sz){
        par.resize(sz, -1);
        rank.resize(sz, 0);
    }
    inline int find(int x){
        if(par[x] < 0)return x;
        else return par[x] = find(par[x]);
    }
    inline int size(int x){
        return -par[find(x)];
    }
    inline int size(){
        return int(par.size());
    }
    inline bool unite(int x, int y){
        x = find(x);
        y = find(y);
        if(x == y)return false;
        if(rank[x] < rank[y])swap(x, y);
        if(rank[x] == rank[y])rank[x]++;
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    inline bool same(int x, int y){
        return find(x) == find(y);
    }
};

int main(){
    
    int N, Q;
    cin >> N >> Q;
    UnionFind uni(N);
    for(int query = 0; query < Q; ++query){
        int p, a, b;
        cin >> p >> a >> b;
        if(p == 0)uni.unite(a, b);
        else cout << (uni.same(a, b) ? "Yes\n" : "No\n");
    }

}

Submission Info

Judge Result