CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results
Submission details
Task:Connect cities
Sender:aarol
Submission time:2024-09-05 23:10:40 +0300
Language:CPython3
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#20.02 sdetails
#30.02 sdetails
#40.02 sdetails
#50.02 sdetails
#60.80 sdetails
#70.79 sdetails
#80.79 sdetails
#90.81 sdetails
#100.80 sdetails
#11ACCEPTED0.24 sdetails
#12ACCEPTED0.02 sdetails

Code

line = input()
parts = line.split(" ")
cities = int(parts[0])
roads = int(parts[1])

adj: dict[int, list[int]] = {}

for i in range(1, cities + 1):
    adj[i] = []

for i in range(0, roads):
    line = input()
    parts = line.split(" ")
    city1 = int(parts[0])
    city2 = int(parts[1])

    adj[city1].append(city2)

seen: list[bool] = [False]*(cities + 1)

def dfs(city: int):
    if seen[city]:
        return
    seen[city] = True
    for adjCity in adj[city]:
        dfs(adjCity)
    
unique: list[int] = []

for city in adj:
    if not seen[city]:
        unique.append(city)
    dfs(city)

new_roads: list = []

for i in range(0, len(unique) - 1):
    new_roads.append((unique[i], unique[i + 1]))

print(len(new_roads))

for a, b in new_roads:
    print(f"{a} {b}")

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

Test 2

Verdict:

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

correct output
2
1 4
4 5

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

Test 3

Verdict:

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

correct output
0

user output
2
1 2
2 5

Test 4

Verdict:

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

correct output
1
1 3

user output
3
1 2
2 3
3 6

Test 5

Verdict:

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

correct output
0

user output
3
1 2
2 3
3 6

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
33276
1 2
2 3
3 4
4 5
...

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
33486
1 2
2 3
3 4
4 5
...

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
33391
1 2
2 3
3 4
4 5
...

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
33475
1 2
2 3
3 4
4 5
...

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
33270
1 2
2 3
3 4
4 5
...

Test 11

Verdict: ACCEPTED

input
100000 1
1 2

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

user output
99998
1 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
2 7