1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/*
 * @uni_kakurenbo
 * https://github.com/uni-kakurenbo/competitive-programming-workspace
 *
 * CC0 1.0  http://creativecommons.org/publicdomain/zero/1.0/deed.ja
 */
/* #language C++ 20 GCC */

#define PROBLEM "https://judge.yosupo.jp/problem/shortest_path"

#include "sneaky/enforce_int128_enable.hpp"

#include <iostream><--- Include file:  not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include "adaptor/vector.hpp"
#include "snippet/aliases.hpp"
#include "structure/graph.hpp"
#include "graph/shortest_path.hpp"
#include "iterable/operation.hpp"
#include "data_structure/removable_priority_queue.hpp"

signed main() {
    uni::i32 n, m, s, t; input >> n >> m >> s >> t;
    uni::graph<uni::i64> graph(n); graph.read<true, false>(m);

    uni::removable_priority_queue<
        std::priority_queue<
            std::pair<uni::i64, uni::i32>,
            std::vector<std::pair<uni::i64, uni::i32>>,
            std::greater<std::pair<uni::i64, uni::i32>>
        >,
        std::set<std::pair<uni::i64, uni::i32>>
    > que;

    uni::vector<uni::i64> dists(n, uni::INF64);
    uni::vector<uni::i32> prev(n, -1);

    que.emplace(dists[s] = 0, s);

    while(!que.empty()) {
        auto [ d, v ] = que.top(); que.pop();

        ITR(e, graph[v]) {
            auto nd = d + e.cost;
            if(nd >= dists[e]) continue;

            que.eliminate(dists[e], e);

            dists[e] = nd;
            prev[e] = v;
            que.emplace(nd, e.to);

        }
    }

    if(dists[t] >= uni::INF64) {
        print(-1);
        return 0;
    }

    auto path = uni::restore_path(t, prev);

    print(dists[t], path.size() - 1);
    REP(i, 1, path.size()) print(path[i - 1], path[i]);
}