CSES - Aalto Competitive Programming 2024 - wk2 - Homework

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

Submission details
Task:	Connect cities
Sender:	Meriem
Submission time:	2024-09-07 01:56:54 +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.78 s	details
#7	RUNTIME ERROR	0.79 s	details
#8	RUNTIME ERROR	0.78 s	details
#9	RUNTIME ERROR	0.79 s	details
#10	RUNTIME ERROR	0.78 s	details
#11	ACCEPTED	0.28 s	details
#12	ACCEPTED	0.02 s	details

Code

def task1(n, roads):
    vis = [False] * n
    graph = [[] for _ in range(n)]

    for a, b in roads:
        graph[b - 1].append(a - 1)  # connect b->a
        graph[a - 1].append(b - 1)  # connect a->b

    subgraphs = []
    for i in range(n):
        if not vis[i]:
            subgraph = []
            dfs(i, graph, vis, subgraph)  # dfs connectivity check
            subgraphs.append(subgraph)

    added_roads = []

    for i in range(len(subgraphs) - 1):  # we connect deepest node in each subgrph
        added_roads.append([subgraphs[i][-1] + 1, subgraphs[i + 1][-1] + 1])

    return added_roads


def dfs(s, adj, vis, subgraph):
    if vis[s]:
        return
    vis[s] = True
    subgraph.append(s)
    for u in adj[s]:
        if not vis[u]:
            dfs(u, adj, vis, subgraph)


if __name__ == "__main__":
    n, m = map(int, input().split())
    roads = []
    for i in range(m):
        a, b = map(int, input().split())
        roads.append([a, b])
    added_roads = task1(n, roads)

    print(len(added_roads))
    for road in added_roads:
        print(road[0], road[1])

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 10 3 3 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 2 4 4 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 10 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 40, in <module>
    added_roads = task1(n, roads)
  File "/box/input/code.py", line 13, in task1
    dfs(i, graph, vis, subgraph)  # dfs connectivity check
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  [Previous line repeated 994 more times]
  File "/box/input/code.py", line 28, in dfs
    subgraph.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 40, in <module>
    added_roads = task1(n, roads)
  File "/box/input/code.py", line 13, in task1
    dfs(i, graph, vis, subgraph)  # dfs connectivity check
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  [Previous line repeated 994 more times]
  File "/box/input/code.py", line 28, in dfs
    subgraph.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 40, in <module>
    added_roads = task1(n, roads)
  File "/box/input/code.py", line 13, in task1
    dfs(i, graph, vis, subgraph)  # dfs connectivity check
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  [Previous line repeated 994 more times]
  File "/box/input/code.py", line 28, in dfs
    subgraph.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 40, in <module>
    added_roads = task1(n, roads)
  File "/box/input/code.py", line 13, in task1
    dfs(i, graph, vis, subgraph)  # dfs connectivity check
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  [Previous line repeated 994 more times]
  File "/box/input/code.py", line 28, in dfs
    subgraph.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 40, in <module>
    added_roads = task1(n, roads)
  File "/box/input/code.py", line 13, in task1
    dfs(i, graph, vis, subgraph)  # dfs connectivity check
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  File "/box/input/code.py", line 31, in dfs
    dfs(u, adj, vis, subgraph)
  [Previous line repeated 994 more times]
  File "/box/input/code.py", line 28, in dfs
    subgraph.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 2 3 3 4 4 5 5 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 10 3 3 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 (Meriem)