Submission #7576398

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std; 

//Union-Find木

int par[100100];

//初期化関数
void init(int n){
  rep(i,n) par[i] = i;
}

//木の根を求める
int root(int x){
  if(par[x] == x) return x;
  else return par[x] = root(par[x]);
}

//xとyの属する集合を併合
void unite(int x, int y){
  int rx = root(x);
  int ry = root(y);
  if(rx == ry) return;
  par[rx] = ry;
}
//判定
bool same(int x, int y){
  return root(x) == root(y);
}

int main(){
  int n, q;
  cin >> n >> q;
  //parを初期化
  init(n);
  //クエリを表す可変長配列
  vector<vector<int>> query(q);
  rep(i,q){
    int a, b, c;
    cin >> a >> b >> c;
    if(!a){
      unite(b,c);
    }else{
      if(same(b,c)) cout << "Yes" << endl;
      else cout << "No" << endl;
    }
  }
  return 0;
}

Submission Info

Judge Result