test/UnionFind.test.cpp

View this file on GitHub
Last update: 2021-09-12 23:44:25+09:00
Problem: https://judge.yosupo.jp/problem/unionfind

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"

#include "../structure/UnionFind.cpp"

int N,Q;
int main(){
    cin>>N>>Q;
    UnionFind uf(N);
    while(Q--){
        int t,u,v;cin>>t>>u>>v;
        if(!t)uf.merge(u,v);
        else cout<<uf.same(u,v)<<"\n";
    }
}

#line 1 "test/UnionFind.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"

#line 2 "template/template.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define REV(i, n) for (int i = n - 1; i > 0; i--)
#define all(v) v.begin(), v.end()
#define PL pair<ll, ll>
#define PI pair<int, int>
#define pi acos(-1)
#define len(s) (int)s.size()
#define compress(v) \
    sort(all(v));   \
    v.erase(unique(all(v)), v.end());
#define comid(v, x) lower_bound(all(v), x) - v.begin()

template<class T>
using prique=priority_queue<T,vector<T>,greater<>>;

template <class T, class U>
inline bool chmin(T &a, U b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T, class U>
inline bool chmax(T &a, U b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
constexpr ll inf = 3e18;
#line 3 "structure/UnionFind.cpp"

class UnionFind {
    int N;
    vector<int> par, siz;

   public:
    int find(int x) {
        assert(x < N);
        return (par[x] == x ? x : par[x] = find(par[x]));
    }
    void merge(int x, int y) {
        assert(x < N && y < N);
        x = find(x);
        y = find(y);
        if (x == y) return;
        if (siz[x] > siz[y]) swap(x, y);
        par[x] = y;
        siz[y] += siz[x];
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    int size(int x) {
        return siz[find(x)];
    }
    UnionFind(int N) : N(N), siz(N, 1), par(N) {
        iota(all(par), 0);
    }
};

/*
@brief Union Find
@docs docs/UnionFind.md
*/
#line 4 "test/UnionFind.test.cpp"

int N,Q;
int main(){
    cin>>N>>Q;
    UnionFind uf(N);
    while(Q--){
        int t,u,v;cin>>t>>u>>v;
        if(!t)uf.merge(u,v);
        else cout<<uf.same(u,v)<<"\n";
    }
}