Submission #420858

---

Source Code Expand

#include <vector>
class UnionFind {
private:
  std::vector<int> disj;
public:
  UnionFind(int n) : disj(n) {
    for (int i = 0; i < n; ++i) {
      disj[i] = i;
    }
  }
  int root(int x) {
    if (disj[x] == x) {
      return x;
    }
    return disj[x] = root(disj[x]);
  }
  void unite(int x, int y) {
    disj[root(x)] = root(y);
  }
  bool is_same_set(int x, int y) {
    return root(x) == root(y);
  }
};

#include <iostream>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef pair<int, int> PI;
const double EPS=1e-9;

int main(void){
  int n, q;
  cin >> n >> q;
  UnionFind uf(n);
  REP(loop_v, 0, q) {
    int p, a, b;
    cin >> p >> a >> b;
    if (p) {
      cout << (uf.is_same_set(a, b) ? "Yes" : "No") << endl;
    } else {
      uf.unite(a, b);
    }
  }
}

Submission Info

Judge Result