Submission #10092739

---

Source Code Expand

n, q = map(int, input().split())
# union-find
par = [-1] * (n + 1)


def find(a):
    if par[a] < 0:
        return a
    else:
        par[a] = find(par[a])
        return par[a]


def size(a):
    return -par[find(a)]


def unite(a, b):
    if find(a) == find(b):
        return False
    else:
        if size(a) < size(b):
            a, b = b, a
        A = find(a)
        B = find(b)
        par[A] -= size(B)
        par[B] = A
        return True


def is_same(a, b):
    return find(a) == find(b)


for _ in range(q):
    p, a, b = map(int, input().split())
    if p:
        print("Yes" if is_same(a, b) else "No")
    else:
        unite(a, b)

Submission Info

Judge Result