Shortest Path (verify/graph/shortest_path.test.cpp)

• View this file on GitHub
• Last update: 2025-12-12 22:29:00+01:00
• Problem: https://judge.yosupo.jp/problem/shortest_path

Depends on

• cp-algo/graph/base.hpp
• cp-algo/graph/concepts.hpp
• cp-algo/graph/edge_types.hpp
• cp-algo/graph/shortest_path.hpp
• cp-algo/structures/stack_union.hpp
• cp-algo/util/big_alloc.hpp

Code

// @brief Shortest Path
#define PROBLEM "https://judge.yosupo.jp/problem/shortest_path"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/graph/shortest_path.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::graph;

void solve() {
    int n, m, s, t;
    cin >> n >> m >> s >> t;
    weighted_digraph g(n);
    g.read_edges(m);
    auto opath = shortest_path(g, s, t);
    if(!opath) {
        cout << -1 << "\n";
    } else {
        auto [d, path] = *opath;
        cout << d << ' ' << size(path) << "\n";
        int v = s;
        for(auto e: path) {
            int w = g.edge(e).traverse(v);
            cout << exchange(v, w) << ' ' << w << "\n";
        }
    }
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env	Name	Status	Elapsed	Memory
g++	almost_line_00	AC	147 ms	25 MB
g++	almost_line_01	AC	150 ms	25 MB
g++	almost_line_02	AC	136 ms	25 MB
g++	example_00	AC	5 ms	4 MB
g++	example_01	AC	4 ms	4 MB
g++	grid_random_00	AC	121 ms	22 MB
g++	grid_swirl_00	AC	155 ms	24 MB
g++	line_00	AC	239 ms	30 MB
g++	max_dense_long_00	AC	81 ms	21 MB
g++	max_dense_random_00	AC	81 ms	21 MB
g++	max_dense_random_01	AC	81 ms	21 MB
g++	max_dense_zero_00	AC	77 ms	21 MB
g++	max_sparse_random_00	AC	93 ms	23 MB
g++	max_sparse_random_01	AC	140 ms	25 MB
g++	max_sparse_random_02	AC	141 ms	25 MB
g++	max_star_00	AC	161 ms	40 MB
g++	max_star_01	AC	183 ms	33 MB
g++	small_00	AC	5 ms	4 MB
g++	small_01	AC	4 ms	4 MB
g++	small_02	AC	4 ms	4 MB
g++	small_03	AC	4 ms	4 MB
g++	small_04	AC	4 ms	4 MB
g++	sparse_random_00	AC	78 ms	24 MB
g++	sparse_random_01	AC	93 ms	25 MB
g++	sparse_random_02	AC	90 ms	20 MB
g++	spfa_killer_00	AC	156 ms	31 MB
g++	wrong_dijkstra_handmade_00	AC	5 ms	4 MB
g++	wrong_dijkstra_killer_00	AC	139 ms	30 MB
g++	wrong_dijkstra_killer_01	AC	199 ms	28 MB

Back to top page