CSES - Aalto Competitive Programming 2025 - wk6 - Homework

Submission details
Task:	Shortest Routes I
Sender:	francden
Submission time:	2025-10-03 08:58:48 +0300
Language:	Python3 (PyPy3)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.04 s	details
#2	ACCEPTED	0.04 s	details
#3	ACCEPTED	0.04 s	details
#4	ACCEPTED	0.04 s	details
#5	ACCEPTED	0.04 s	details
#6	ACCEPTED	0.82 s	details
#7	ACCEPTED	0.82 s	details
#8	ACCEPTED	0.83 s	details
#9	ACCEPTED	0.81 s	details
#10	ACCEPTED	0.83 s	details
#11	ACCEPTED	1.17 s	details
#12	ACCEPTED	0.27 s	details
#13	ACCEPTED	0.04 s	details
#14	ACCEPTED	0.36 s	details
#15	ACCEPTED	0.41 s	details
#16	ACCEPTED	0.77 s	details
#17	ACCEPTED	0.74 s	details
#18	ACCEPTED	1.01 s	details

Code

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

adj_list =[]
priority_queue = []
heapq.heappush(priority_queue, (0, 0))
state = [0 for _ in range(n)]
distance = [0 for _ in range(n)]
for i in  range(n):
    adj_list.append([])

for i in range(m):
    a,b,c = [int(x) for x in input().split()]
    adj_list[a-1].append([c,b-1])
        

i = 0

while priority_queue:
    dist,node = heapq.heappop(priority_queue)
    while state[node] == 1 and priority_queue: 
        dist,node = heapq.heappop(priority_queue)
    
    if state[node]==1:
        break
    
    state[node]=1
    distance[node] = dist

    for neigh in adj_list[node]:
        if state[neigh[1]] == 0:
            
            new_dist = dist + neigh[0]
            heapq.heappush(priority_queue,[new_dist,neigh[1]])
    
print(' '.join([str(x) for x in distance]))

Test details

Test 1

Verdict: ACCEPTED

input
`10 20 8 5 1 9 10 2 7 9 8 9 8 8 ...` view save

correct output
`0 9 11 20 13 14 19 29 27 29` view save

user output
`0 9 11 20 13 14 19 29 27 29` view save

Test 2

Verdict: ACCEPTED

input
`10 20 5 6 4 5 1 7 7 4 4 7 8 1 ...` view save

correct output
`0 7 9 17 15 17 21 22 25 30` view save

user output
`0 7 9 17 15 17 21 22 25 30` view save

Test 3

Verdict: ACCEPTED

input
`10 20 1 4 1 4 2 1 9 10 1 1 2 4 ...` view save

correct output
`0 2 11 1 2 7 16 18 12 13` view save

user output
`0 2 11 1 2 7 16 18 12 13` view save

Test 4

Verdict: ACCEPTED

input
`10 20 6 3 5 7 5 8 5 1 8 8 9 5 ...` view save

correct output
`0 5 9 18 22 10 14 23 27 36` view save

user output
`0 5 9 18 22 10 14 23 27 36` view save

Test 5

Verdict: ACCEPTED

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

correct output
`0 8 16 18 11 17 24 23 16 26` view save

user output
`0 8 16 18 11 17 24 23 16 26` view save

Test 6

Verdict: ACCEPTED

input
`100000 200000 18000 18001 426710313 73018 73012 558438094 87726 87671 355171790 53170 53171 869493690 ...` view save

correct output
`0 479659405 1165315262 1854343...` view save

user output
`0 479659405 1165315262 1854343...` view save

Test 7

Verdict: ACCEPTED

input
`100000 200000 26504 26450 258578924 49543 49544 28958186 75174 75175 89459846 39175 39228 119699475 ...` view save

correct output
`0 655556128 1413395076 1814086...` view save

user output
`0 655556128 1413395076 1814086...` view save

Test 8

Verdict: ACCEPTED

input
`100000 200000 39477 39413 773046299 69758 69759 558754983 23279 23280 142570619 61416 61479 874921013 ...` view save

correct output
`0 269736525 626115013 70199222...` view save

user output
`0 269736525 626115013 70199222...` view save

Test 9

Verdict: ACCEPTED

input
`100000 200000 76662 76636 844365635 73339 73342 755006676 89878 89879 396562588 18801 18781 954807004 ...` view save

correct output
`0 598585836 1267139909 1803859...` view save

user output
`0 598585836 1267139909 1803859...` view save

Test 10

Verdict: ACCEPTED

input
`100000 200000 11724 11725 818399968 33244 33197 722525474 65530 65531 483965413 62405 62454 199581867 ...` view save

correct output
`0 387990617 441010945 92441292...` view save

user output
`0 387990617 441010945 92441292...` view save

Test 11

Verdict: ACCEPTED

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

correct output
`0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

Test 12

Verdict: ACCEPTED

input
`100000 99999 1 2 1000000000 2 3 1000000000 3 4 1000000000 4 5 1000000000 ...` view save

correct output
`0 1000000000 2000000000 300000...` view save

user output
`0 1000000000 2000000000 300000...` view save

Test 13

Verdict: ACCEPTED

input
`1 1 1 1 1` view save

correct output
`0` view save

user output
`0` view save

Test 14

Verdict: ACCEPTED

input
`99999 149997 1 2 1 2 3 1 3 4 1 4 5 1 ...` view save

correct output
`0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 ...` view save

user output
`0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 ...` view save

Test 15

Verdict: ACCEPTED

input
`99997 149994 1 3 3 3 5 3 5 7 3 7 9 3 ...` view save

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

user output
`0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

Test 16

Verdict: ACCEPTED

input
`60003 120000 1 2 30010 1 3 30010 1 4 30010 1 5 30010 ...` view save

correct output
`0 30010 30010 30010 30010 3001...` view save

user output
`0 30010 30010 30010 30010 3001...` view save

Test 17

Verdict: ACCEPTED

input
`60003 120000 1 2 30010 1 3 30010 1 4 30010 1 5 30010 ...` view save

correct output
`0 30010 30010 30010 30010 3001...` view save

user output
`0 30010 30010 30010 30010 3001...` view save

Test 18

Verdict: ACCEPTED

input
`100000 149997 1 50000 99997 1 49999 99995 1 49998 99993 1 49997 99991 ...` view save

correct output
`0 1 3 5 7 9 11 13 15 17 19 21 ...` view save

user output
`0 1 3 5 7 9 11 13 15 17 19 21 ...` view save

Aalto Competitive Programming 2025 - wk6 - Homework

Shortest Routes I

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

Tasks

Submissions (francden)