Submission #11601466

---

Source Code Expand

#include <iostream>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;

vector<int> par(100000);

int root(int x) {
    if (par[x] == x) return x;
    par[x] = root(par[x]);
    return par[x];
}

void unite(int x, int y) {
    int rx = root(x);
    int ry = root(y);
    if (rx == ry) return;
    par[rx] = ry;
    return;
}

bool same(int x, int y) {
    int rx = root(x);
    int ry = root(y);
    return rx == ry;
}

int main() {
    int N, Q;
    cin >> N >> Q;
    vector<int> P(Q), A(Q), B(Q);
    rep(i, Q) cin >> P[i] >> A[i] >> B[i];
    
    rep(i, N) par[i] = i;
    rep(i, Q) {
        if (P[i] == 0) unite(A[i], B[i]);
        else if (same(A[i], B[i])) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}

Submission Info

Judge Result