Connect cities

from collections import defaultdict


def dfs(node: int, visited: list[bool], adj: list[list[int]]):
    if visited[node]:
        return
    visited[node] = True
    for neighbor in adj[node]:
        if not visited[neighbor]:
            dfs(neighbor, visited, adj)


n, m = [int(x) for x in input().split()]

adj = defaultdict(list)
components = []

for i in range(m):
    a, b = [int(x) for x in input().split()]
    adj[a].append(b)
    adj[b].append(a)

visited = [False] * (n + 1)

for node in range(1, n + 1):
    if not visited[node]:
        components.append(node)
        dfs(node, visited, adj)

print(len(components) - 1)
for i in range(1, len(components)):
    print(f"{components[i-1]} {components[i]}")

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: RUNTIME ERROR

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

Test 7

Verdict: RUNTIME ERROR

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

Test 8

Verdict: RUNTIME ERROR

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

Test 9

Verdict: RUNTIME ERROR

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

Test 10

Verdict: RUNTIME ERROR

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

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED