Submission #6603105

---

Source Code Expand

# 2019/07/29
# Union-Find

class unionfind():
    def __init__(self,n):
        self.par=list(range(n+1))
        self.rank=[0]*(n+1)
    
    def find(self,x):
        if self.par[x]==x:
            return x
        else:
            self.par[x]=self.find(self.par[x])
            return self.par[x]
    
    def is_same(self,x,y):
        return self.find(x)==self.find(y)
    
    def unite(self,x,y):
        x=self.find(x)
        y=self.find(y)
        if self.rank[x]<self.rank[y]:
            self.par[x]=y
        else:
            self.par[y]=x
            if self.rank[x]==self.rank[y]:
                self.rank[x]+=1

n,q=map(int,input().split())
uf=unionfind(n)
for i in range(q):
    q,x,y=map(int,input().split())

    if q:
        print('Yes' if uf.is_same(x,y) else 'No')
    else:
        uf.unite(x,y)
    

Submission Info

Judge Result