Submission #423154

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>

using namespace std;

struct UnionFind {
  int data[200001];
  UnionFind() {
    fill_n(data, 200001, 0);
  }
  bool unionSet(int x, int y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool findSet(int x, int y) {
    return root(x) == root(y);
  }
  int root(int x) {
    return data[x] < 0 ? x : data[x] = root(data[x]);
  }
  int size(int x) {
    return -data[root(x)];
  }
};

int main() {
  int N, Q;
  int P, A, B;

  UnionFind uf;

  cin >> N >> Q;
  for (int i = 0; i < Q; ++i) {
    cin >> P >> A >> B;
    if (P == 0) {
      uf.unionSet(A, B);
    }
    if (P == 1) {
      if (uf.findSet(A, B)) {
        cout << "Yes" << endl;
      }else {
        cout << "No" << endl;
      }

    }
  }
  return 0;
}

Submission Info

Judge Result