Submission details
Task:Connect cities
Sender:klaava
Submission time:2025-09-06 22:10:58 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.04 sdetails
#60.53 sdetails
#70.53 sdetails
#80.52 sdetails
#90.53 sdetails
#100.53 sdetails
#11ACCEPTED0.19 sdetails
#12ACCEPTED0.04 sdetails

Code

n, m = [int(x) for x in input().split()]
roads = []
for i in range(m):
    roads.append([int(x) - 1 for x in input().split()])

class City:
    def __init__(self, n):
        self.n = n
        self.roads = [] 

cities = []
for i in range(n):
    cities.append(City(n))
for road in roads:
    cities[road[0]].roads.append(road[1])
    cities[road[1]].roads.append(road[0])

def find_deepest_path(city_i, cities, visited_cities, depth):
    city = cities[city_i]
    visited_cities[city_i] = True
    if not city.roads:
        return city_i, visited_cities, depth
    
    maxd = depth
    maxd_i = city_i
    for connected_city_i in city.roads:
        if connected_city_i not in visited_cities:
            i, visited_cities, d = find_deepest_path(connected_city_i, cities, visited_cities, depth+1)
            if d >= maxd:
                maxd = d
                maxd_i = i
    return maxd_i, visited_cities, maxd

created_roads = []
visited_cities = {}
last_new_i = -1
for i in range(n):

    if i not in visited_cities:
        new_i, visited_cities, _ = find_deepest_path(i, cities, visited_cities, 0)
        if last_new_i != -1:
            created_roads.append([last_new_i + 1, i + 1])
        last_new_i = new_i


print(len(created_roads))    
for r in created_roads:
    print(f'{r[0]} {r[1]}')


Test details

Test 1

Verdict: ACCEPTED

input
10 10
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
2
10 2
9 7

Test 2

Verdict: ACCEPTED

input
10 10
3 9
6 8
9 10
7 8
...

correct output
2
1 4
4 5

user output
2
2 4
4 5

Test 3

Verdict: ACCEPTED

input
10 10
7 9
1 7
1 3
3 4
...

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
10 10
4 8
5 9
4 9
2 7
...

correct output
1
1 3

user output
1
10 3

Test 5

Verdict: ACCEPTED

input
10 10
4 9
2 4
7 10
1 8
...

correct output
0

user output
0

Test 6

Verdict:

input
100000 200000
7233 22146
94937 96203
6133 10731
98737 99193
...

correct output
4785
1 2
2 3
3 4
4 5
...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 40, in <module>
    new_i,...

Test 7

Verdict:

input
100000 200000
92950 93575
24401 88897
41796 99364
47106 50330
...

correct output
4868
1 2
2 7
7 9
9 15
...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 40, in <module>
    new_i,...

Test 8

Verdict:

input
100000 200000
15637 76736
79169 98809
4382 86557
73383 77029
...

correct output
4683
1 9
9 20
20 27
27 28
...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 40, in <module>
    new_i,...

Test 9

Verdict:

input
100000 200000
47932 66981
86401 99942
4353 27841
60492 67345
...

correct output
4807
1 6
6 7
7 11
11 12
...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 40, in <module>
    new_i,...

Test 10

Verdict:

input
100000 200000
6554 44548
76413 98555
5447 59589
70166 74434
...

correct output
4786
1 2
2 18
18 21
21 27
...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 40, in <module>
    new_i,...

Test 11

Verdict: ACCEPTED

input
100000 1
1 2

correct output
99998
1 3
3 4
4 5
5 6
...

user output
99998
2 3
3 4
4 5
5 6
...
Truncated

Test 12

Verdict: ACCEPTED

input
10 9
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
2
10 2
9 7