CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results
Submission details
Task:Connect cities
Sender:TrixterTheTux
Submission time:2024-09-10 14:14:32 +0300
Language:Python3 (CPython3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#20.02 sdetails
#3ACCEPTED0.02 sdetails
#40.02 sdetails
#50.02 sdetails
#60.83 sdetails
#70.83 sdetails
#80.83 sdetails
#90.83 sdetails
#100.86 sdetails
#11ACCEPTED0.38 sdetails
#12ACCEPTED0.02 sdetails

Code

n, m = map(int, input().split())
roads = [tuple(map(int, input().split())) for _ in range(m)]

chunk_counter = 0
chunks = {}
chunk_roads = {}
roads_to_build = {}
for road_a, road_b in roads:
    if road_a not in chunks and road_b not in chunks:
        chunk_counter += 1
        chunks[road_a] = chunk_counter
        chunks[road_b] = chunk_counter
        
        chunk_roads[chunk_counter] = [road_a, road_b]
        if chunk_counter != 1:
            roads_to_build[frozenset([chunk_counter - 1, chunk_counter])] = (chunk_roads[chunk_counter - 1][0], road_a)
    elif road_a in chunks and road_b not in chunks:
        chunks[road_b] = chunks[road_a]

        chunk_roads[chunks[road_a]].append(road_b)
    elif road_b in chunks and road_a not in chunks:
        chunks[road_a] = chunks[road_b]

        chunk_roads[chunks[road_b]].append(road_a)
    elif road_a in chunks and road_b in chunks:
        pass
        # if chunks[road_a] != chunks[road_b]:
            # del roads_to_build[frozenset([chunks[road_a], chunks[road_b]])]
    else:
        raise Exception('?')

for city in range(1, n + 1):
    if city not in chunks:
        chunk_counter += 1
        chunks[city] = chunk_counter
        chunk_roads[chunk_counter] = [city]

        if city != 1:
            roads_to_build[frozenset([1, chunk_counter])] = (chunk_roads[1][0], city)

print(len(roads_to_build))
for road_a, road_b in roads_to_build.values():
    print(road_a, road_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
2 1
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
3
3 6
3 4
3 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:

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

correct output
1
1 3

user output
3
4 5
5 2
4 3

Test 5

Verdict:

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

correct output
0

user output
2
4 7
7 1

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
28156
7233 94937
94937 6133
6133 98737
98737 67601
...
Truncated

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
28078
92950 24401
24401 41796
41796 47106
47106 5688
...
Truncated

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
27965
15637 79169
79169 4382
4382 73383
73383 59245
...
Truncated

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
27997
47932 86401
86401 4353
4353 60492
60492 88503
...
Truncated

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
27967
6554 76413
76413 5447
5447 70166
70166 96736
...
Truncated

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