Submission #1612972

---

Source Code Expand

# coding: utf-8
"""docstring"""


class UnionFind(object):
    """UnionFind (経路圧縮のみ、ランクなし)"""
    def __init__(self, n):
        self.parents = list(range(n))

    def union(self, n1, n2):
        r1 = self.root(n1)
        r2 = self.root(n2)
        if r1 != r2:
            self.parents[r2] = r1

    def root(self, node):
        p = self.parents[node]
        if p == node:
            return p
        p = self.root(p)
        self.parents[node] = p
        return p

    def same(self, n1, n2):
        return self.root(n1) == self.root(n2)


def main():
    N, Q = map(int, input().split())
    uf = UnionFind(N)
    for i in range(Q):
        p, a, b = map(int, input().split())
        if p == 0:
            uf.union(a, b)
        elif p == 1:
            print("Yes" if uf.same(a, b) else "No")


if __name__ == "__main__":
    main()

Submission Info

Judge Result