K_shortest_walk.test.cpp

#define PROBLEM "https://judge.yosupo.jp/problem/k_shortest_walk"
#include "my_template.hpp"
#include "other/io.hpp"
#include "graph/base.hpp"
#include "graph/shortest_path/K_shortest_walk.hpp"

void solve() {
  INT(N, M, s, t, K);
  Graph<int, 1> G1(N);
  G1.read_graph(M, 1, 0);
  auto ANS = K_shortest_walk<ll, decltype(G1), 5'000'000>(G1, s, t, K);
  for (auto &&x: ANS) {
    if (x == infty<ll>) x = -1;
    print(x);
  }
}

signed main() {
  solve();
  return 0;
}