Submission #5486484

---

Source Code Expand

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

const int MAX_N = 200005;
int N;
int Q;
int p;
int a;
int b;

int par[MAX_N]; //親
int tree_rank[MAX_N]; //木の深さ

//n要素で初期化
void init(int n) {
  for (int i = 0; i < n; i++) {
    par[i] = i;
    tree_rank[i] = 0;
  }
}

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

//xとyに属する集合を併合
void unite(int x, int y) {
  x = find(x);
  y = find(y);
  if (x == y) return;

  if (tree_rank[x] < tree_rank[y]) {
    par[x] = y;
  }
  else {
    par[y] = x;
    if (tree_rank[x] == tree_rank[y]) tree_rank[x]++;
  }
}

//xとyが同じ集合に属するか判定
bool same(int x, int y) {
  return find(x) == find(y);
}


int main() {
  init(Q);

  cin >> N >> Q;
  for (int i = 0; i < Q; i++) {
    cin >> p >> a >> b;
    if (p == 0) {
      unite(a, b);
    }
    if (p == 1) {
      bool frag = same(a, b);
      if (frag) cout << "Yes" << endl;
      else cout << "No" << endl;
    }
  }
}

Submission Info

Judge Result