Submission #420843

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int N, Q;
int t[100001];

int root(int i) {
    if (t[i] == i) {
        return i;
    }else {
        // 経路圧縮
        return (t[i] = root(t[i]));
    }
}

int main(void)
{
    cin >> N >> Q;

    for (int i=0; i<N; i++) {
        t[i] = i;
    }

    for (int i=0; i<Q; i++) {
        int p, a, b;
        cin >> p >> a >> b;
        if (p == 0) {
            // 連結
            int r2 = root(a);
            int r1 = root(b);
            t[r2] = r1;
        } else {
            // ちぇっく
            int r1 = root(a);
            int r2 = root(b);
            cout << (r1 == r2 ? "Yes" : "No") << endl;
        }
    }
    return 0;
}

Submission Info

Judge Result