Problem:
You are given an undirected graph with N vertices and 0 edges. Process Q queries of the following types.    * `0 u v`: Add an edge (u, v).   * `1 u v`: Print 1 if u and v are in the same connected component, 0 otherwise.

Incorrect submission (verdict: Wrong Answer):
class UnionFind():
    def __init__(self, n):	
        self.n = n
        self.parents = [-1] * n
    def find(self, x):		
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):	
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):		
        return -self.parents[self.find(x)]
    def same(self, x, y):	
        return self.find(x) == self.find(y)
    def members(self, x):	
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):		
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):	
        return len(self.roots())
    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}
    def __str__(self):		
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n,q = map(int,input().split())
uf = UnionFind(n)
ans = []
l = 0
for i in range(q):
    t,u1,u2 = map(int,input().split())
    if(t == 0):
        uf.union(u1,u2)
    else:
        if(uf.same(u1,u2)):
            ans.append(1)
        else:
            ans.append(0)
        l += 1

print([ans[i] for i in range(l)])



Fixed, accepted submission:
class UnionFind():
    def __init__(self, n):	
        self.n = n
        self.parents = [-1] * n
    def find(self, x):		
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):	
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):		
        return -self.parents[self.find(x)]
    def same(self, x, y):	
        return self.find(x) == self.find(y)
    def members(self, x):	
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):		
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):	
        return len(self.roots())
    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}
    def __str__(self):		
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n,q = map(int,input().split())
uf = UnionFind(n)
ans = []
l = 0
for i in range(q):
    t,u1,u2 = map(int,input().split())
    if(t == 0):
        uf.union(u1,u2)
    else:
        if(uf.same(u1,u2)):
            ans.append(1)
        else:
            ans.append(0)
        l += 1

for i in range(l):
    print(ans[i])