Submission #420231

---

Source Code Expand

#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

struct UnionFind {
  vector<int> parent;
  UnionFind (int n) : parent(n, -1) {}
  int root(int x) { return parent[x] < 0 ? x : parent[x] = root(parent[x]); }
  bool merge(int x, int y) {
    x = root(x); y = root(y);
    if (x == y) return false;
    if (parent[y] < parent[x]) swap(x, y);
    if (parent[x] == parent[y]) --parent[x];
    parent[y] = x;
    return true;
  }
};

int main() {
  int N, Q;
  cin >> N >> Q;
  UnionFind uf(N);
  REP(i,Q) {
    int p, a, b;
    cin >> p >> a >> b;
    if (p == 0) uf.merge(a, b);
    else {
      int x = uf.root(a), y = uf.root(b);
      cout << (x == y ? "Yes" : "No") << endl;
    }
  }
  return 0;
}

Submission Info

Judge Result