Submission #11420751

---

Source Code Expand

// https://atcoder.jp/contests/abcXXX/tasks/abcXXX_x

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll>;

static const ll INF = 1001001001;
static const ll LLINF = 1001001001001001001;
static const ll MOD = (ll)1e9 + 7;
static const double EPS = 1e-9;

#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define RANGE(i, m, n) for(ll i = (m); i <= (n); ++i)
#define RRANGE(i, m, n) for(ll i = (m); i >= (n); --i)
#define POSITIVE(x) (x)=((x) < 0) ? 0 : (x)

int run(istream& in, ostream& out) {
    ll N, Q;
    in >> N >> Q;
    vector<ll> parent(N);
    REP(i, N) {
        parent[i] = i;
    }
    std::function<ll(ll)> root = [&](ll x) {
        if (parent[x] == x) return x;
        return parent[x] = root(parent[x]);
    };

    std::function<bool(ll, ll)> same = [&](ll x, ll y) {
        return root(x) == root(y);
    };

    std::function<void(ll, ll)> join = [&](ll x, ll y) {
        parent[root(x)] = root(y);
    };
    REP(i, Q) {
        ll p, a, b;
        in >> p >> a >> b;
        if (p == 0) join(a,b);
        if (p == 1) {
            out << (same(a,b) ? "Yes" : "No") << endl;
        }
    }
    return 0;
}

int main() {
    return run(cin, cout);
}

Submission Info

Judge Result