CSES - Aalto Competitive Programming 2024 - wk2 - Homework

CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results

Submission details
Task:	Connect cities
Sender:	ZDHKLV
Submission time:	2024-09-05 16:06:26 +0300
Language:	CPython3
Status:	READY
Result:	RUNTIME ERROR

Test results
test	verdict	time
#1	ACCEPTED	0.02 s	details
#2	ACCEPTED	0.02 s	details
#3	ACCEPTED	0.02 s	details
#4	ACCEPTED	0.02 s	details
#5	ACCEPTED	0.02 s	details
#6	RUNTIME ERROR	0.79 s	details
#7	RUNTIME ERROR	0.79 s	details
#8	RUNTIME ERROR	0.79 s	details
#9	RUNTIME ERROR	0.79 s	details
#10	RUNTIME ERROR	0.80 s	details
#11	ACCEPTED	0.24 s	details
#12	ACCEPTED	0.02 s	details

Code

N, M = [ int(x) for x in input("").split(" ") ]
ROADS = [ [ int(x)-1 for x in input("").split(" ") ] for _ in range(M) ]

def build_adjacency(n: int, roads: list[tuple[int, int]]) -> list[list[int]]:

    result: list[list[int]] = [ [] for _ in range(n) ]

    for a, b in roads:
        result[a].append(b)
        result[b].append(a)
    
    return result

def build_components(n: int, adj: list[list[int]]) -> list[list[int]]:

    def dfs(x: int, mark: list[int], id: int):
        if mark[x] != -1:
            return
        mark[x] = id
        for y in adj[x]:
            dfs(y, mark, id)
    
    id = 0
    mark = [-1] * n

    for i in range(n):
        if mark[i] == -1:
            dfs(i, mark, id)
            id += 1

    result: list[list[int]] = [ [] for _ in range(id) ]

    for i in range(n):
        result[mark[i]].append(i)

    return result

def build_paths(components: list[list[int]]) -> tuple[int, list[tuple[int, int]]]:

    k = len(components) - 1
    paths: list[tuple[int, int]] = [None] * k

    for i in range(1, k+1):
        paths[i-1] = (components[0][0], components[i][0])

    return k, paths

def solve(n: int, roads: list[tuple[int, int]]):
    k, paths = build_paths(build_components(n, build_adjacency(n, roads)))
    print(k)
    for a, b in paths:
        print(f"{a+1} {b+1}")

solve(N, ROADS)

Test details

Test 1

Verdict: ACCEPTED

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

correct output
`2 1 2 2 7` view save

user output
`2 1 2 1 7` view save

Test 2

Verdict: ACCEPTED

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

correct output
`2 1 4 4 5` view save

user output
`2 1 4 1 5` 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: ACCEPTED

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

correct output
`1 1 3` view save

user output
`1 1 3` 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: RUNTIME ERROR

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 54, in <module>
    solve(N, ROADS)
  File "/box/input/code.py", line 49, in solve
    k, paths = build_paths(build_components(n, build_adjacency(n, roads)))
  File "/box/input/code.py", line 28, in build_components
    dfs(i, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 17, in dfs
    if mark[x] != -1:
RecursionError: maximum recursion depth exceeded in comparison

Test 7

Verdict: RUNTIME ERROR

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 54, in <module>
    solve(N, ROADS)
  File "/box/input/code.py", line 49, in solve
    k, paths = build_paths(build_components(n, build_adjacency(n, roads)))
  File "/box/input/code.py", line 28, in build_components
    dfs(i, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 17, in dfs
    if mark[x] != -1:
RecursionError: maximum recursion depth exceeded in comparison

Test 8

Verdict: RUNTIME ERROR

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 54, in <module>
    solve(N, ROADS)
  File "/box/input/code.py", line 49, in solve
    k, paths = build_paths(build_components(n, build_adjacency(n, roads)))
  File "/box/input/code.py", line 28, in build_components
    dfs(i, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 17, in dfs
    if mark[x] != -1:
RecursionError: maximum recursion depth exceeded in comparison

Test 9

Verdict: RUNTIME ERROR

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 54, in <module>
    solve(N, ROADS)
  File "/box/input/code.py", line 49, in solve
    k, paths = build_paths(build_components(n, build_adjacency(n, roads)))
  File "/box/input/code.py", line 28, in build_components
    dfs(i, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 17, in dfs
    if mark[x] != -1:
RecursionError: maximum recursion depth exceeded in comparison

Test 10

Verdict: RUNTIME ERROR

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 54, in <module>
    solve(N, ROADS)
  File "/box/input/code.py", line 49, in solve
    k, paths = build_paths(build_components(n, build_adjacency(n, roads)))
  File "/box/input/code.py", line 28, in build_components
    dfs(i, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  File "/box/input/code.py", line 21, in dfs
    dfs(y, mark, id)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 17, in dfs
    if mark[x] != -1:
RecursionError: maximum recursion depth exceeded in comparison

Test 11

Verdict: ACCEPTED

input
`100000 1 1 2` view save

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

user output
`99998 1 3 1 4 1 5 1 6 ...` view save

Test 12

Verdict: ACCEPTED

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

correct output
`2 1 2 2 7` view save

user output
`2 1 2 1 7` view save

Aalto Competitive Programming 2024 - wk2 - Homework

Connect cities

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Tasks

Submissions (ZDHKLV)