Submission #4561372

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long,long long>
#define all(a) a.begin(),a.end()
using namespace std;

class Union_Find_Size{
private:
    vector<int> par;
public:
    Union_Find_Size(int n){
        par=vector<int>(n,-1);
    }
    int find(int x){
        if(par.at(x)<0) return x;
        else return par.at(x)=find(par.at(x));
    }
    int size(int x){
        return -par.at(find(x));
    }
    void unite(int x, int y){
        x=find(x);
        y=find(y);
        if(x==y) return;
        if(size(x)<size(y)) swap(x,y);
        par.at(x)+=par.at(y);
        par.at(y)=x;
    }
    bool same(int x, int y){
        return find(x)==find(y);
    }
};

signed main(){
    int n,q; cin>>n>>q;
    vector<int> p(q),a(q),b(q);
    rep(i,q){
        cin>>p.at(i)>>a.at(i)>>b.at(i);
    }
    Union_Find_Size uni(n);
    rep(i,q){
        if(p.at(i)==0){
            uni.unite(a.at(i), b.at(i));
        }else{
            cout<<(uni.same(a.at(i), b.at(i))?"Yes":"No")<<endl;
        }
    }
}

Submission Info

Judge Result