Submission #5799745

---

Source Code Expand

#union-find-tree
def init(n):
    lis = []
    for i in range(n+1):
        lis.append(i)
    return lis
def find(lis, x):
    if lis[x] == x:
        return x
    else:
        lis[x] = find(lis, lis[x])
        return lis[x]
def sameset(lis, x, y):
    return find(lis, x) == find(lis, y)
def union(lis, x, y):
    x = find(lis, x)
    y = find(lis, y)
    if x != y:
        lis[x] = y

N, Q = map(int, input().split())
union_find_lis = init(N)
for _ in range(Q):
    P, A, B = map(int, input().split())
    if P == 0:
        union(union_find_lis, A, B)
    else:
        if sameset(union_find_lis, A, B):
            print('Yes')
        else:
            print('No')

Submission Info

Judge Result