— Dark mode

Aalto Competitive Programming 2024 - wk2 - Homework

Connect cities

  • Start: 2024-09-04 12:00:00
  • End: 2024-09-12 12:00:00
CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results
Submission details
Task:Connect cities
Sender:aarol
Submission time:2024-09-04 21:33:29 +0300
Language:CPython3
Status:READY
Result:
Test results
testverdicttime
#10.02 sdetails
#20.02 sdetails
#3ACCEPTED0.02 sdetails
#40.02 sdetails
#5ACCEPTED0.02 sdetails
#60.94 sdetails
#70.94 sdetails
#80.93 sdetails
#90.93 sdetails
#100.94 sdetails
#110.02 sdetails
#120.02 sdetails

Code

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

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

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

    if city1 in adj:
        adj[city1].add(city2)
    else:
        adj[city1] = set([city2])
    if city2 in adj:
        adj[city2].add(city1)
    else:
        adj[city2] = set([city1])


seen: set[int] = set([])


def dfs(city: int):
    if city in seen:
        return
    seen.add(city)
    for city in adj[city]:
        dfs(city)


unique: list[int] = []

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

uniq = list(unique)

new_roads: list = []

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

print(len(new_roads))

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

Test details

Test 1

Verdict:

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

correct output
2
1 2
2 7
view save

user output
1
2 1
view save

Test 2

Verdict:

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

correct output
2
1 4
4 5
view save

user output
0
view save

Test 3

Verdict: ACCEPTED

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

correct output
0
view save

user output
0
view save

Test 4

Verdict:

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

correct output
1
1 3
view save

user output
0
view save

Test 5

Verdict: ACCEPTED

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

correct output
0
view save

user output
0
view save

Test 6

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 40, in <module>
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 28, in dfs
    if city in seen:
RecursionError: maximum recursion depth exceeded in comparison

Test 7

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 40, in <module>
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 30, in dfs
    seen.add(city)
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 8

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 40, in <module>
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 28, in dfs
    if city in seen:
RecursionError: maximum recursion depth exceeded in comparison

Test 9

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 40, in <module>
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 30, in dfs
    seen.add(city)
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 10

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 40, in <module>
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  File "/box/input/code.py", line 32, in dfs
    dfs(city)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 30, in dfs
    seen.add(city)
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 11

Verdict:

input
100000 1
1 2
view save

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

user output
0
view save

Test 12

Verdict:

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

correct output
2
1 2
2 7
view save

user output
1
2 1
view save

Tasks

A Connect citiesB Apartments

Submissions (aarol)

2024-09-09 19:06:33 2024-09-09 16:15:07 2024-09-07 15:14:07 2024-09-07 14:59:41 2024-09-05 23:10:40 2024-09-05 13:35:46 2024-09-05 12:52:33 2024-09-05 12:12:16 2024-09-04 21:40:26 2024-09-04 21:33:29 2024-09-04 21:15:05