Building Teams

def building_teams(n,friendships):

    from collections import defaultdict

    graph = defaultdict(list)
    for a,b in friendships:
        graph[a].append(b)
        graph[b].append(a)

    visited = [False] * (n+1) 
    components = []

    def dfs(node, component):
        visited[node] = True
        component.append(node)
        for neighbour in graph[node]:
            if not visited[neighbour]:
                dfs(neighbour, component)

    for i in range(1, n+1):
        if not visited[i]:
            component = []
            dfs(i, component)
            components.append(component)

    return components

def solution(n, frienships):
    components = building_teams(n,friendships)

    if n==1:
        return "IMPOSSIBLE"
    
    group1 = []
    group2 = []
    for i in range(len(components)-1):
        group1 = components[i][0]
        group2 = components[i+1][0]
    
    return group1


n,m = map(int, input().split())

friendships = []
for _ in range(m):
    a,b = map(int, input().split())
    friendships.append((a,b))

# print(building_teams(n,friendships))
print(solution(n,friendships))

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 51, in <module>
    p...

Test 7

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 51, in <module>
    p...

Test 8

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 51, in <module>
    p...

Test 9

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 51, in <module>
    p...

Test 10

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "/box/input/code.py", line 51, in <module>
    p...

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER