Submission #5211584

---

Source Code Expand

def find(x):
    if root[x] == x:
        return x
    else:
        return find(root[x])

def unite(x,y):
    x = find(x)
    y = find(y)
    if x != y:
        if rank[x] < rank[y]:
            root[x] = y
            size[y] += size[x]
        else:
            root[y] = x
            size[x] += size[y]
            if rank[x]==rank[y]:
                rank[x] += 1

def same(x,y):
    return find(x) == find(y)

#############################################

n,q = map(int,input().split())
root = [0]*n
for i in range(n):
    root[i] = i
rank = [1]*n
size = [1]*n

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

Submission Info

Judge Result