test/yosupo/graph/shortest_path.test.cpp

• View this file on GitHub
• Last update: 2025-06-13 13:22:21+09:00
• Problem: https://judge.yosupo.jp/problem/shortest_path

Depends on

• 重み付きグラフ (lib/graph/graph.hpp)
• lib/template/template.hpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shortest_path
#include <functional>
#include <iostream>
#include <limits>
#include <queue>
#include <utility>
#include <vector>
#include "graph/graph.hpp"
#include "template/template.hpp"

template <class T>
std::pair<std::vector<T>, std::vector<int>> dijkstra(const Graph<T> &g, int s = 0,
                                                     T inf = std::numeric_limits<T>::max()) {
    struct _node {
        constexpr _node() : _to(), _dist() {}
        constexpr _node(int to, T dist) : _to(to), _dist(dist) {}

        constexpr bool operator<(const _node &rhs) const { return this->dist() < rhs.dist(); }
        constexpr bool operator>(const _node &rhs) const { return rhs < *this; }

        constexpr int to() const { return this->_to; }
        constexpr T dist() const { return this->_dist; }

      private:
        int _to;
        T _dist;
    };
    std::vector<T> dists(g.size(), inf);
    std::vector<int> v(g.size(), -1);
    std::priority_queue<_node, std::vector<_node>, std::greater<>> p_que;
    dists[s] = T();
    p_que.emplace(s, T());
    while (!p_que.empty()) {
        auto node = p_que.top();
        p_que.pop();
        if (dists[node.to()] < node.dist()) continue;
        for (auto &e : g[node.to()]) {
            if (chmin(dists[e.to()], node.dist() + e.weight())) {
                v[e.to()] = node.to();
                p_que.emplace(e.to(), node.dist() + e.weight());
            }
        }
    }
    return {dists, v};
}

int main(void) {
    int n, m, s, t;
    std::cin >> n >> m >> s >> t;
    Graph<std::int64_t> g(n);
    g.input_edge(m, 0);
    auto &&[dist, v] = dijkstra(g, s, INF);
    if (dist[t] == INF) {
        std::cout << -1 << '\n';
    } else {
        std::vector<std::pair<int, int>> ans;
        int idx = t;
        while (idx != s) {
            ans.emplace_back(v[idx], idx);
            idx = v[idx];
        }
        std::reverse(ans.begin(), ans.end());
        std::cout << dist[t] << ' ' << ans.size() << '\n';
        for (auto p : ans) std::cout << p.first << ' ' << p.second << '\n';
    }
    return 0;
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 291, 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 242, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 479, in update
    self._resolve(pathlib.Path(included), included_from=path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 286, in _resolve
    raise BundleErrorAt(path, -1, "no such header")
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: graph/graph.hpp: line -1: no such header

Test cases

Env	Name	Status	Elapsed	Memory
g++	almost_line_00	AC	523 ms	29 MB
g++	almost_line_01	AC	490 ms	29 MB
g++	almost_line_02	AC	403 ms	29 MB
g++	example_00	AC	3 ms	4 MB
g++	example_01	AC	2 ms	3 MB
g++	grid_random_00	AC	464 ms	20 MB
g++	grid_swirl_00	AC	470 ms	22 MB
g++	line_00	AC	678 ms	44 MB
g++	max_dense_long_00	AC	287 ms	14 MB
g++	max_dense_random_00	AC	351 ms	14 MB
g++	max_dense_random_01	AC	284 ms	14 MB
g++	max_dense_zero_00	AC	199 ms	14 MB
g++	max_sparse_random_00	AC	432 ms	28 MB
g++	max_sparse_random_01	AC	496 ms	29 MB
g++	max_sparse_random_02	AC	485 ms	29 MB
g++	max_star_00	AC	442 ms	42 MB
g++	max_star_01	AC	561 ms	42 MB
g++	small_00	AC	3 ms	4 MB
g++	small_01	AC	2 ms	3 MB
g++	small_02	AC	2 ms	3 MB
g++	small_03	AC	2 ms	3 MB
g++	small_04	AC	2 ms	4 MB
g++	sparse_random_00	AC	363 ms	32 MB
g++	sparse_random_01	AC	368 ms	36 MB
g++	sparse_random_02	AC	300 ms	17 MB
g++	spfa_killer_00	AC	429 ms	38 MB
g++	wrong_dijkstra_handmade_00	AC	3 ms	4 MB
g++	wrong_dijkstra_killer_00	AC	405 ms	31 MB
g++	wrong_dijkstra_killer_01	AC	509 ms	35 MB

Back to top page