Submission #3401459

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int par[100*1000+3];
int root(int i){
  if(par[i]==i)return i;
  return par[i]=root(par[i]);
}
void merge(int a,int b){
  a=root(a);
  b=root(b);
  if(a==b)return;
  if(rand()%2)par[a]=b;
  else par[b]=a;
}
int main(){
  int n;cin>>n;
  for(int i=1;i<=n;++i)par[i]=i;
  int q;cin>>q;
  while(q--){
    int p,a,b;cin>>p>>a>>b;
    if(p==0){
      //merge
      merge(a,b);
    }else{
      //query
      if(root(a)==root(b))puts("Yes");
      else puts("No");
    }
  }
  return 0;
}

Submission Info

Judge Result