Submission #1687310

---

Source Code Expand

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

//http://atc001.contest.atcoder.jp/tasks/unionfind_a

#define RESIDUE(u,v) (capacity[u][v] - flow[u][v])
#define RCOST(u,v) (cost[u][v] + h[u] - h[v])
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)   FOR(i,0,n)

#define MAX_N 100000

int par[MAX_N],rnk[MAX_N];

void init(int n){
  REP(i,n){
    par[i]=i;
    rnk[i]=0;
  }
}

int root(int x){
  return par[x]==x?x:par[x]=root(par[x]);
}

bool same(int x,int y){
  return root(x)==root(y);
}

void unite(int x,int y){
  x=root(x);
  y=root(y);
  if(x==y)
    return;
  if(rnk[x]<rnk[y]){
    par[x]=y;
  }else{
    par[y]=x;
    if(rnk[x]==rnk[y]) rnk[x]++;
  }
}


int main(){
  int n,q,p,a,b;
  cin>>n>>q;
  init(n);
  REP(i,q){
    cin>>p>>a>>b;
    if(p==0){
      unite(a,b);
    }else{
      cout<<(same(a,b)?"Yes":"No")<<endl;
    }
  }
  return 0;
}

Submission Info

Judge Result