Submission #4029621

---

Source Code Expand

#include <iostream>
using namespace std;
typedef long long ll;
ll n,q,w,x,y,z,r[200001],fa[200001];
ll find(ll x){
    if(fa[x]==x)return x;
    return fa[x]=find(fa[x]);
}
void uni(ll x,ll y){
    x=find(x);
    y=find(y);
    if(x==y)return ;
    if(r[x]<r[y])swap(x,y);
    fa[y]=x;
    if(r[x]==r[y])r[x]++;
}
int main(void){
    cin>>n>>q;
    for(int i=1;i<=2*n;i++)fa[i]=i;
    while(q--){
        cin>>w>>x>>y>>z;
        if(w==1){
            uni(2*x,2*y-(1&z));
            uni(2*x-1,2*y-1+(1&z));
        }
        else{
            if(find(2*x)==find(2*y))cout<<"YES"<<endl;
            else cout<<"NO"<<endl;
        }
    }
}

Submission Info

Judge Result