Submission #74948437

---

Source Code Expand

import sys
sys.setrecursionlimit(10**7)

class UnionFind:
    def __init__(self, n:int):
        self.parent = [-1]*n

    def union(self, x:int, y:int):
        ax = self.find(x)
        ay = self.find(y)
        if ax == ay:
            return
        self.parent[ay] = ax

    def find(self, x:int):
        if self.parent[x] == -1:
            return x
        self.parent[x] = self.find(self.parent[x])
        return self.parent[x]
    
    def same(self, x:int, y:int):
        return self.find(x) == self.find(y)

n,q = (int(a) for a in input().split())
uf = UnionFind(n)
ans = []

for _ in range(q):
    p,a,b = (int(x) for x in input().split())
    if p==0:
        uf.union(a-1,b-1)
    else:
        ans.append(uf.same(a-1,b-1))

for b in ans:
    if b:
        print('Yes')
    else:
        print('No')

Submission Info

Judge Result