Submission #7622126

---

Source Code Expand

n, q = [ int(v) for v in input().split() ]
parent_list = [ i for i in range(n) ]

def root(x):
    compress_node = []
    while parent_list[x] != x:
        compress_node.append(x)
        x = parent_list[x]   
    for i in compress_node:
        parent_list[i] = x
    return x

for i in range(q):
    p, a, b = [ int(v) for v in input().split() ]
    if p == 0:
        if root(a) != root(b):
            parent_list[a] = b
    else:
        print( "Yes" if root(a) == root(b) else "No" )

Submission Info

Judge Result