# verification-helper: PROBLEM https://judge.yosupo.jp/problem/shortest_path
include cplib/tmpl/sheep
import cplib/graph/graph
import cplib/graph/dijkstra
var N, M, s, t = ii()
var G = initWeightedDirectedGraph(N)
for i in 0..<M:
var a, b, c = ii()
G.add_edge(a, b, c)
var (path, cost) = G.shortest_path_dijkstra(s, t)
if len(path) == 1:
echo -1
else:
echo cost, " ", len(path)-1
for i in 0..<len(path)-1:
echo path[i], " ", path[i+1]
Traceback (most recent call last):
File "/home/runner/.local/lib/python3.12/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/home/runner/.local/lib/python3.12/site-packages/onlinejudge_verify/languages/nim.py", line 86, in bundle
raise NotImplementedError
NotImplementedError
verify/graph/dynamic/restore_dijkstra_test.nim