tests/dijkstra.py

• View this file on GitHub
• Last update: 2025-04-17 21:49:15+09:00
• Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A

Depends on

• libs/dijkstra.py
• libs/graph.py
• libs/standard_input.py
• libs/utils.py

Code

# competitive-verifier: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A
from libs.dijkstra import dijkstra
from libs.graph import GraphW
from libs.standard_input import il
from libs.utils import INF

N, M, S = il()
G = GraphW(N, dire=True)

for _ in [0] * M:
    a, b, w = il()
    G.new_side(a, b, w)

ans = dijkstra(G.all(), S)

for t in ans:
    if t == INF:
        print("INF")
    else:
        print(t)

Test cases

Env	Name	Status	Elapsed	Memory
Python	00_sample_00.in	AC	39 ms	12 MB
Python	00_sample_01.in	AC	32 ms	12 MB
Python	01_small_00.in	AC	32 ms	12 MB
Python	01_small_01.in	AC	33 ms	12 MB
Python	02_medium_00.in	AC	34 ms	12 MB
Python	02_medium_01.in	AC	31 ms	12 MB
Python	03_corner_00.in	AC	32 ms	12 MB
Python	03_corner_01.in	AC	34 ms	12 MB
Python	03_corner_02.in	AC	33 ms	12 MB
Python	03_corner_03.in	AC	30 ms	12 MB
Python	04_rand_00.in	AC	29 ms	12 MB
Python	04_rand_01.in	AC	29 ms	12 MB
Python	04_rand_02.in	AC	30 ms	12 MB
Python	04_rand_03.in	AC	32 ms	12 MB
Python	05_linear_00.in	AC	32 ms	12 MB
Python	05_linear_01.in	AC	34 ms	12 MB
Python	05_linear_02.in	AC	38 ms	12 MB
Python	05_linear_03.in	AC	36 ms	12 MB
Python	06_ring_00.in	AC	32 ms	12 MB
Python	06_ring_01.in	AC	33 ms	12 MB
Python	06_ring_02.in	AC	36 ms	12 MB
Python	06_ring_03.in	AC	35 ms	12 MB
Python	07_large_00.in	AC	33 ms	12 MB
Python	07_large_01.in	AC	37 ms	12 MB
Python	07_large_02.in	AC	51 ms	13 MB
Python	07_large_03.in	AC	57 ms	13 MB
Python	08_large_00.in	AC	60 ms	14 MB
Python	08_large_01.in	AC	75 ms	15 MB
Python	08_large_02.in	AC	82 ms	16 MB
Python	08_large_03.in	AC	104 ms	17 MB
Python	09_maximum_00.in	AC	658 ms	45 MB
Python	09_maximum_01.in	AC	1676 ms	95 MB
Python	09_maximum_02.in	AC	391 ms	39 MB
Python	09_maximum_03.in	AC	804 ms	53 MB

Back to top page