CSES - Aalto Competitive Programming 2025 - wk7 - Wed

Submission details
Task:	Longest route
Sender:	aalto25h_001
Submission time:	2025-10-22 16:47:21 +0300
Language:	Python3 (PyPy3)
Status:	READY
Result:	RUNTIME ERROR

Test results
test	verdict	time
#1	ACCEPTED	0.04 s	details
#2	ACCEPTED	0.04 s	details
#3	ACCEPTED	0.04 s	details
#4	RUNTIME ERROR	0.07 s	details
#5	ACCEPTED	0.04 s	details
#6	RUNTIME ERROR	0.41 s	details
#7	ACCEPTED	0.55 s	details
#8	ACCEPTED	0.61 s	details
#9	ACCEPTED	0.58 s	details
#10	ACCEPTED	0.46 s	details
#11	ACCEPTED	0.31 s	details
#12	RUNTIME ERROR	0.38 s	details
#13	ACCEPTED	0.04 s	details
#14	ACCEPTED	0.04 s	details
#15	RUNTIME ERROR	0.34 s	details
#16	ACCEPTED	0.04 s	details
#17	RUNTIME ERROR	0.34 s	details
#18	TIME LIMIT EXCEEDED	--	details
#19	ACCEPTED	0.04 s	details
#20	RUNTIME ERROR	0.30 s	details
#21	ACCEPTED	0.04 s	details

Code

n, m = [int(x) for x in input().split()]

matrice = {i:set() for i in range(1, n+1)}
for _ in range(m):
    a, b = [int(x) for x in input().split()]
    matrice[a].add(b)

def dfs(node, tab=[]):
    new_tab = tab.copy()
    new_tab.append(node)
    if node == n:
        return new_tab
    local_tab = []
    for next_node in matrice[node]:
        res_tab = dfs(next_node, new_tab)
        if len(res_tab) > len(local_tab):
            local_tab = res_tab
    return local_tab


res = dfs(1)
if res[-1] != n:
    print("IMPOSSIBLE")
else:
    print(len(res))
    for elt in res:
        print(elt, end=' ')

Test details

Test 1

Verdict: ACCEPTED

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

correct output
`5 1 2 5 6 10` view save

user output
`5 1 2 5 6 10` view save

Test 2

Verdict: ACCEPTED

input
`10 10 3 9 6 5 6 9 2 8 ...` view save

correct output
`4 1 2 8 10` view save

user output
`4 1 2 8 10` view save

Test 3

Verdict: ACCEPTED

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

correct output
`3 1 4 10` view save

user output
`3 1 4 10` view save

Test 4

Verdict: RUNTIME ERROR

input
`10 10 8 10 2 6 2 10 7 10 ...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 22, in <module>
    if res[-1] != n:
IndexError: list index out of range

Test 5

Verdict: ACCEPTED

input
`10 10 8 4 2 10 1 3 4 9 ...` view save

correct output
`5 1 8 7 2 10` view save

user output
`5 1 8 4 9 10` view save

Test 6

Verdict: RUNTIME ERROR

input
`100000 200000 86085 57043 45527 29537 41919 84699 95993 82082 ...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 22, in <module>
    if res[-1] != n:
IndexError: list index out of range

Test 7

Verdict: ACCEPTED

input
`100000 200000 10961 53490 59843 36636 40674 66772 32618 41570 ...` view save

correct output
`31 1 37239 44082 21537 90572 7332...` view save

user output
`31 1 37239 44082 21537 90572 7332...` view save

Test 8

Verdict: ACCEPTED

input
`100000 200000 87375 76468 38855 27547 49415 83191 38572 1524 ...` view save

correct output
`35 1 91343 59014 56722 34054 3875...` view save

user output
`35 1 91343 59014 56722 34054 3875...` view save

Test 9

Verdict: ACCEPTED

input
`100000 200000 17973 70097 19982 80323 96486 2404 75650 63274 ...` view save

correct output
`36 1 25685 90292 59380 91058 2663...` view save

user output
`36 1 25685 90292 59380 91058 2663...` view save

Test 10

Verdict: ACCEPTED

input
`100000 200000 74343 53088 97443 7885 64807 58252 9374 33312 ...` view save

correct output
`28 1 26390 15278 11333 48479 6881...` view save

user output
`28 1 26390 15278 11333 48479 6881...` view save

Test 11

Verdict: ACCEPTED

input
`100000 199998 1 100000 1 100000 2 100000 2 100000 ...` view save

correct output
`2 1 100000` view save

user output
`2 1 100000` view save

Test 12

Verdict: RUNTIME ERROR

input
`100000 199998 1 2 1 2 2 3 2 3 ...` view save

correct output
`100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 21, in <module>
    res = dfs(1)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  [Previous line repeated 1576 more times]
  File "input/code.py", line 9, in dfs
    new_tab = tab.copy()
RecursionError: maximum recursion depth exceeded

Test 13

Verdict: ACCEPTED

input
`2 1 1 2` view save

correct output
`2 1 2` view save

user output
`2 1 2` view save

Test 14

Verdict: ACCEPTED

input
`5 4 1 2 2 3 3 4 1 5` view save

correct output
`2 1 5` view save

user output
`2 1 5` view save

Test 15

Verdict: RUNTIME ERROR

input
`99999 149997 1 3 3 5 5 7 7 9 ...` view save

correct output
`99999 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 21, in <module>
    res = dfs(1)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  [Previous line repeated 1576 more times]
  File "input/code.py", line 9, in dfs
    new_tab = tab.copy()
RecursionError: maximum recursion depth exceeded

Test 16

Verdict: ACCEPTED

input
`3 2 1 3 3 2` view save

correct output
`2 1 3` view save

user output
`2 1 3` view save

Test 17

Verdict: RUNTIME ERROR

input
`99999 149997 1 2 2 4 4 6 6 8 ...` view save

correct output
`99999 1 3 2 5 4 7 6 9 8 11 10 13 12 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 21, in <module>
    res = dfs(1)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  [Previous line repeated 1576 more times]
  File "input/code.py", line 9, in dfs
    new_tab = tab.copy()
RecursionError: maximum recursion depth exceeded

Test 18

Verdict: TIME LIMIT EXCEEDED

input
`100000 200000 1 2 1 3 1 4 1 5 ...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 19

Verdict: ACCEPTED

input
`5 4 2 1 3 1 1 4 1 5` view save

correct output
`2 1 5` view save

user output
`2 1 5` view save

Test 20

Verdict: RUNTIME ERROR

input
`100000 99999 99999 100000 99998 99999 99997 99998 99996 99997 ...` view save

correct output
`100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "input/code.py", line 21, in <module>
    res = dfs(1)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  File "input/code.py", line 15, in dfs
    res_tab = dfs(next_node, new_tab)
  [Previous line repeated 1576 more times]
  File "input/code.py", line 9, in dfs
    new_tab = tab.copy()
RecursionError: maximum recursion depth exceeded

Test 21

Verdict: ACCEPTED

input
`4 4 3 1 3 4 1 2 2 4` view save

correct output
`3 1 2 4` view save

user output
`3 1 2 4` view save

Aalto Competitive Programming 2025 - wk7 - Wed

Longest route

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

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Tasks

Submissions (aalto25h_001)