Submission details
Task:Connect cities
Sender:aalto26bh_028
Submission time:2026-09-06 02:52:30 +0300
Language:Python3 (CPython3)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.02 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#6ACCEPTED0.95 sdetails
#7ACCEPTED0.94 sdetails
#8ACCEPTED0.92 sdetails
#9ACCEPTED0.93 sdetails
#10ACCEPTED0.94 sdetails
#11ACCEPTED0.34 sdetails
#12ACCEPTED0.02 sdetails

Code

n, m = input().split()
n, m = int(n), int(m)
group_index_of_cities = list(range(1,n+1))
cities_for_index = {k:{k} for k in range(1,n+1)}
for route in range(m):
    a, b = input().split()
    a, b = int(a), int(b)
    if group_index_of_cities[a-1]!=group_index_of_cities[b-1]:
        if len(cities_for_index[group_index_of_cities[a-1]])<len(cities_for_index[group_index_of_cities[b-1]]):
            a,b = b,a
        set_to_change = cities_for_index.pop(group_index_of_cities[b-1])
        for city in set_to_change:
            group_index_of_cities[city-1] = group_index_of_cities[a-1]
        cities_for_index[group_index_of_cities[a-1]] |= set_to_change
# print(group_index_of_cities)
# print(cities_for_index)


count_bridges = 0
bridges_list = []
for city in range(1,n):
    if group_index_of_cities[city] != group_index_of_cities[city-1]:
        # print("Bridging cities", city, "(group", group_index_of_cities[city-1],") and", city+1,"(group", group_index_of_cities[city],")")
        # if len(cities_for_index[group_index_of_cities[a-1]])<len(group_index_of_cities[b-1]):
        #     a,b = b,a
        count_bridges+=1
        bridges_list.append((city, city+1))
        set_to_bridge = cities_for_index.pop(group_index_of_cities[city])
        for city_to_move in set_to_bridge:
            group_index_of_cities[city_to_move-1] = group_index_of_cities[city-1]
        cities_for_index[group_index_of_cities[city-1]] |= set_to_bridge

print(count_bridges)
for br in bridges_list:
    print(br[0], br[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
1 2
6 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
3 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
2 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: ACCEPTED

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

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

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

Test 7

Verdict: ACCEPTED

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

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

user output
4868
1 2
6 7
8 9
14 15
...

Test 8

Verdict: ACCEPTED

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

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

user output
4683
8 9
19 20
26 27
27 28
...

Test 9

Verdict: ACCEPTED

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

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

user output
4807
5 6
6 7
10 11
11 12
...

Test 10

Verdict: ACCEPTED

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

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

user output
4786
1 2
17 18
20 21
26 27
...

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
...

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
1 2
6 7