Problem p02573 (python)

Fixed 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,m = map(int, input().split())
uf = UnionFind(n)
for i in range(m):
  a,b = map(int, input().split())
  uf.union(a-1, b-1)

ans = 0
for i in range(n):
  ans = max(uf.size(i),ans)
  
print(ans)

Buggy submission (verdict: Runtime Error):
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,m = map(int, input().split())
uf = UnionFind(n)
for i in range(m):
  a,b = map(int, input().split())
  uf.union(a, b)

ans = 0
for i in list(uf.all_group_members().values()):
  ans = max(len(i),ans)
  
print(ans)

Buggy submission (verdict: Runtime Error):
import collections
n,m = map(int, input().split())

friends = [0] * n
query = []

for i in range(m):
  a,b = map(int, input().split())
  if friends[a - 1] == 0 and  friends[b - 1] == 0:
    friends[a - 1] = tmp
    friends[b - 1] = tmp
    tmp += 1
  elif friends[a - 1] == 0:
    friends[a - 1] = friends[b - 1]
  elif friends[b - 1] == 0:
    friends[b - 1] = friends[a - 1]
  else:
    index_num = [n for n, v in enumerate(friends) if v == friends[a - 1]]
    duplicated = friends[b - 1]
    for i in index_num:
      friends[i] = duplicated

counted = collections.Counter(friends)
if counted.most_common()[0][1] != 0:
  print(counted.most_common()[0][1])
else:
  print(counted.most_common()[0][2])

Buggy submission (verdict: Runtime Error):
n,m = map(int, input().split())

friends = [[0] * n for i in range(n)]

for i in range(m):
  a,b = map(int, input().split())
  friends[a-1][b-1] = 1
  friends[b-1][a-1] = 1
  
ans = 0
for i in friends:
  if sum(i) > ans:
    ans = sum(i)
    
print(ans+1)