test/verify/yukicoder-1069.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 14:57:04+00:00
• Problem: https://yukicoder.me/problems/no/1069

Depends on

• Graph Template (グラフテンプレート) (graph/graph-template.hpp)
• K Shortest Path (graph/shortest-path/k-shortest-path.hpp)

Code

// competitive-verifier: ERROR 1e-4
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/1069

#include <cmath>
#include <iostream>
#include <vector>

#include "../../graph/graph-template.hpp"
#include "../../graph/shortest-path/k-shortest-path.hpp"

using namespace std;

int main() {
  int N, M, K;
  cin >> N >> M >> K;
  int X, Y;
  cin >> X >> Y;
  --X, --Y;
  vector<int> P(N), Q(N);
  for (int i = 0; i < N; i++) {
    cin >> P[i] >> Q[i];
  }
  Graph<double> g(N);
  vector<int> x(M * 2), y(M * 2);
  for (int i = 0; i < M; i++) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    g.add_directed_edge(a, b, hypot(P[a] - P[b], Q[a] - Q[b]));
    x[i] = a, y[i] = b;
  }
  for (int i = 0; i < M; i++) {
    int a = x[i], b = y[i];
    x[i + M] = b, y[i + M] = a;
    g.add_directed_edge(b, a, hypot(P[a] - P[b], Q[a] - Q[b]));
  }
  auto ans = k_shortest_path(g, X, Y, K);
  for (int i = 0; i < K; i++) {
    if (i < ans.size())
      cout << ans[i].first << "\n";
    else
      cout << -1 << "\n";
  }
}

#line 1 "test/verify/yukicoder-1069.test.cpp"
// competitive-verifier: ERROR 1e-4
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/1069

#include <cmath>
#include <iostream>
#include <vector>

#line 2 "graph/graph-template.hpp"

#include <cstddef>
#line 6 "graph/graph-template.hpp"

template <typename T = int>
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1)
      : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template <typename T = int>
struct Graph {
  std::vector<std::vector<Edge<T> > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  std::size_t size() const { return g.size(); }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false,
            bool directed = false) {
    for (int i = 0; i < M; i++) {
      int a, b;
      std::cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) std::cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

  inline std::vector<Edge<T> >& operator[](const int& k) { return g[k]; }

  inline const std::vector<Edge<T> >& operator[](const int& k) const {
    return g[k];
  }
};

template <typename T = int>
using Edges = std::vector<Edge<T> >;
#line 2 "graph/shortest-path/k-shortest-path.hpp"

#include <algorithm>
#include <cassert>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#line 14 "graph/shortest-path/k-shortest-path.hpp"

#line 16 "graph/shortest-path/k-shortest-path.hpp"

/**
 * @brief K-Shortest-Path
 *
 * @see https://qiita.com/nariaki3551/items/821dc6ffdc552d3d5f22
 */
template <typename T>
std::vector<std::pair<T, std::vector<int> > > k_shortest_path(const Graph<T>& g,
                                                              int s, int t,
                                                              int k) {
  assert(s != t);
  int N = (int)g.size();
  int M = 0;
  for (int i = 0; i < N; i++) M += (int)g[i].size();
  std::vector<int> latte(M), malta(M);
  std::vector<T> cost(M);
  for (int i = 0; i < N; i++) {
    for (auto& e : g[i]) {
      latte[e.idx] = i;
      malta[e.idx] = e.to;
      cost[e.idx] = e.cost;
    }
  }
  const auto INF = std::numeric_limits<T>::max();
  std::vector<int> dame(M, -1);
  int timestamp = 0;
  auto shortest_path = [&](std::vector<T>& dist, std::vector<int>& from,
                           std::vector<int>& id, int st) {
    using Pi = std::pair<T, int>;
    std::priority_queue<Pi, std::vector<Pi>, std::greater<> > que;
    que.emplace(dist[st], st);
    while (!que.empty()) {
      T cost;
      int idx;
      std::tie(cost, idx) = que.top();
      que.pop();
      if (dist[idx] < cost) continue;
      if (idx == t) return;
      for (auto& e : g[idx]) {
        auto next_cost = cost + e.cost;
        if (dist[e.to] <= next_cost) continue;
        if (dame[e.idx] == timestamp) continue;
        dist[e.to] = next_cost;
        from[e.to] = idx;
        id[e.to] = e.idx;
        que.emplace(dist[e.to], e.to);
      }
    }
  };
  auto restore = [](const std::vector<int>& es, const std::vector<int>& vs,
                    int from, int to) {
    std::vector<int> tap;
    while (to != from) {
      tap.emplace_back(es[to]);
      to = vs[to];
    }
    std::reverse(std::begin(tap), std::end(tap));
    return tap;
  };

  std::vector<T> dist(g.size(), INF);
  std::vector<int> from(g.size(), -1), id(g.size(), -1);
  dist[s] = 0;
  shortest_path(dist, from, id, s);
  if (dist[t] == INF) return {};

  std::vector<std::pair<T, std::vector<int> > > A;
  std::set<std::pair<T, std::vector<int> > > B;
  A.emplace_back(dist[t], restore(id, from, s, t));

  for (int i = 1; i < k; i++) {
    dist.assign(g.size(), INF);
    from.assign(g.size(), -1);
    id.assign(g.size(), -1);
    dist[s] = 0;
    std::vector<int> candidate(A.size());
    std::iota(std::begin(candidate), std::end(candidate), 0);
    auto& last_path = A.back().second;
    int cur = s;
    for (int j = 0; j < last_path.size(); j++) {
      for (auto& k : candidate) {
        if (j < A[k].second.size()) dame[A[k].second[j]] = timestamp;
      }
      std::vector<T> dist2{dist};
      std::vector<int> from2{from}, id2{id};
      shortest_path(dist2, from2, id2, cur);
      ++timestamp;
      if (dist2[t] != INF) {
        auto path = restore(id2, from2, s, t);
        bool ok = true;
        for (auto& p : candidate) {
          if (path == A[p].second) {
            ok = false;
            break;
          }
        }
        if (ok) B.emplace(dist2[t], path);
      }
      std::vector<int> accept;
      for (auto& k : candidate) {
        if (j < A[k].second.size() && A[k].second[j] == last_path[j]) {
          accept.emplace_back(k);
        }
      }
      dist[malta[last_path[j]]] =
          dist[latte[last_path[j]]] + cost[last_path[j]];
      from[malta[last_path[j]]] = latte[last_path[j]];
      id[malta[last_path[j]]] = last_path[j];
      cur = malta[last_path[j]];
      candidate = std::move(accept);
    }
    if (B.size()) {
      A.emplace_back(*B.begin());
      B.erase(B.begin());
    }
  }
  return A;
}
#line 10 "test/verify/yukicoder-1069.test.cpp"

using namespace std;

int main() {
  int N, M, K;
  cin >> N >> M >> K;
  int X, Y;
  cin >> X >> Y;
  --X, --Y;
  vector<int> P(N), Q(N);
  for (int i = 0; i < N; i++) {
    cin >> P[i] >> Q[i];
  }
  Graph<double> g(N);
  vector<int> x(M * 2), y(M * 2);
  for (int i = 0; i < M; i++) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    g.add_directed_edge(a, b, hypot(P[a] - P[b], Q[a] - Q[b]));
    x[i] = a, y[i] = b;
  }
  for (int i = 0; i < M; i++) {
    int a = x[i], b = y[i];
    x[i + M] = b, y[i + M] = a;
    g.add_directed_edge(b, a, hypot(P[a] - P[b], Q[a] - Q[b]));
  }
  auto ans = k_shortest_path(g, X, Y, K);
  for (int i = 0; i < K; i++) {
    if (i < ans.size())
      cout << ans[i].first << "\n";
    else
      cout << -1 << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	01_sample_01	AC	2 ms	4 MB
g++	01_sample_02	AC	2 ms	4 MB
g++	01_sample_03	AC	2 ms	4 MB
g++	01_sample_04	AC	2 ms	4 MB
g++	98_challenge01	AC	51 ms	7 MB
g++	98_challenge02	AC	48 ms	11 MB
g++	arand_halfsame	AC	5 ms	4 MB
g++	arand_same	AC	5 ms	4 MB
g++	arnd1	AC	4 ms	4 MB
g++	arnd2	AC	5 ms	4 MB
g++	arnd3	AC	4 ms	4 MB
g++	arnd4	AC	2 ms	4 MB
g++	arnd5	AC	3 ms	4 MB
g++	brand_halfsame	AC	4 ms	4 MB
g++	brand_same	AC	3 ms	4 MB
g++	brnd1	AC	3 ms	4 MB
g++	brnd2	AC	3 ms	4 MB
g++	brnd3	AC	3 ms	4 MB
g++	brnd4	AC	3 ms	4 MB
g++	brnd5	AC	5 ms	4 MB
g++	complete1	AC	3 ms	4 MB
g++	complete_halfsame	AC	3 ms	4 MB
g++	complete_same	AC	3 ms	4 MB
g++	comptele21	AC	6 ms	4 MB
g++	corner1	AC	5 ms	4 MB
g++	corner2	AC	6 ms	4 MB
g++	corner21	AC	4 ms	4 MB
g++	corner22	AC	5 ms	4 MB
g++	corner23	AC	4 ms	4 MB
g++	easy_to_hard_rnd_mini3	AC	3 ms	4 MB
g++	easy_to_hard_rnd_mini5	AC	2 ms	4 MB
g++	hack	AC	2 ms	4 MB
g++	hack2	AC	2 ms	4 MB
g++	hack3	AC	2 ms	4 MB
g++	hand1	AC	2 ms	4 MB
g++	hand2	AC	2 ms	4 MB
g++	hand3	AC	2 ms	4 MB
g++	mini1	AC	3 ms	4 MB
g++	mini2	AC	3 ms	4 MB
g++	mini3	AC	2 ms	4 MB
g++	mini4	AC	2 ms	4 MB
g++	mini5	AC	3 ms	4 MB
g++	mini_halfsame	AC	3 ms	4 MB
g++	mini_same	AC	2 ms	4 MB
g++	mitsu1	AC	4 ms	4 MB
g++	mitsu2	AC	3 ms	4 MB
g++	mitsu3	AC	4 ms	4 MB
g++	mitsu4	AC	4 ms	4 MB
g++	mitsu5	AC	5 ms	4 MB
g++	newrnd1	AC	4 ms	4 MB
g++	newrnd2	AC	3 ms	4 MB
g++	newrnd3	AC	4 ms	4 MB
g++	newrnd4	AC	3 ms	4 MB
g++	newrnd5	AC	4 ms	4 MB
g++	rndmini1	AC	2 ms	4 MB
g++	rndmini10	AC	2 ms	4 MB
g++	rndmini11	AC	2 ms	4 MB
g++	rndmini12	AC	2 ms	4 MB
g++	rndmini13	AC	2 ms	4 MB
g++	rndmini14	AC	2 ms	4 MB
g++	rndmini15	AC	2 ms	4 MB
g++	rndmini2	AC	2 ms	4 MB
g++	rndmini3	AC	2 ms	4 MB
g++	rndmini4	AC	2 ms	4 MB
g++	rndmini5	AC	2 ms	4 MB
g++	rndmini6	AC	2 ms	4 MB
g++	rndmini7	AC	2 ms	4 MB
g++	rndmini8	AC	2 ms	4 MB
g++	rndmini9	AC	2 ms	4 MB
g++	tree1	AC	4 ms	4 MB
g++	tree2	AC	3 ms	4 MB
g++	tree3	AC	4 ms	4 MB
g++	tree4	AC	3 ms	4 MB
g++	tree5	AC	3 ms	4 MB
g++	tree_halfsame	AC	4 ms	4 MB
g++	tree_same	AC	4 ms	4 MB
g++	unique1	AC	5 ms	4 MB
g++	unique2	AC	5 ms	4 MB
g++	unique3	AC	2 ms	4 MB
g++	unique4	AC	4 ms	4 MB
g++	unique5	AC	5 ms	4 MB
g++	uniquebig1	AC	3 ms	4 MB
g++	uniquebig2	AC	4 ms	4 MB
clang++	01_sample_01	AC	2 ms	4 MB
clang++	01_sample_02	AC	2 ms	4 MB
clang++	01_sample_03	AC	2 ms	4 MB
clang++	01_sample_04	AC	2 ms	4 MB
clang++	98_challenge01	AC	47 ms	7 MB
clang++	98_challenge02	AC	45 ms	11 MB
clang++	arand_halfsame	AC	5 ms	4 MB
clang++	arand_same	AC	5 ms	4 MB
clang++	arnd1	AC	4 ms	4 MB
clang++	arnd2	AC	5 ms	4 MB
clang++	arnd3	AC	4 ms	4 MB
clang++	arnd4	AC	2 ms	4 MB
clang++	arnd5	AC	3 ms	4 MB
clang++	brand_halfsame	AC	4 ms	4 MB
clang++	brand_same	AC	3 ms	4 MB
clang++	brnd1	AC	3 ms	4 MB
clang++	brnd2	AC	3 ms	4 MB
clang++	brnd3	AC	3 ms	4 MB
clang++	brnd4	AC	3 ms	4 MB
clang++	brnd5	AC	5 ms	4 MB
clang++	complete1	AC	3 ms	4 MB
clang++	complete_halfsame	AC	3 ms	4 MB
clang++	complete_same	AC	3 ms	4 MB
clang++	comptele21	AC	6 ms	4 MB
clang++	corner1	AC	5 ms	4 MB
clang++	corner2	AC	6 ms	4 MB
clang++	corner21	AC	4 ms	4 MB
clang++	corner22	AC	5 ms	4 MB
clang++	corner23	AC	4 ms	4 MB
clang++	easy_to_hard_rnd_mini3	AC	3 ms	4 MB
clang++	easy_to_hard_rnd_mini5	AC	2 ms	4 MB
clang++	hack	AC	2 ms	4 MB
clang++	hack2	AC	2 ms	4 MB
clang++	hack3	AC	2 ms	4 MB
clang++	hand1	AC	2 ms	4 MB
clang++	hand2	AC	2 ms	4 MB
clang++	hand3	AC	2 ms	4 MB
clang++	mini1	AC	3 ms	4 MB
clang++	mini2	AC	3 ms	4 MB
clang++	mini3	AC	2 ms	4 MB
clang++	mini4	AC	2 ms	4 MB
clang++	mini5	AC	3 ms	4 MB
clang++	mini_halfsame	AC	2 ms	4 MB
clang++	mini_same	AC	2 ms	4 MB
clang++	mitsu1	AC	4 ms	4 MB
clang++	mitsu2	AC	3 ms	4 MB
clang++	mitsu3	AC	4 ms	4 MB
clang++	mitsu4	AC	4 ms	4 MB
clang++	mitsu5	AC	5 ms	4 MB
clang++	newrnd1	AC	4 ms	4 MB
clang++	newrnd2	AC	3 ms	4 MB
clang++	newrnd3	AC	4 ms	4 MB
clang++	newrnd4	AC	3 ms	4 MB
clang++	newrnd5	AC	4 ms	4 MB
clang++	rndmini1	AC	2 ms	4 MB
clang++	rndmini10	AC	2 ms	4 MB
clang++	rndmini11	AC	2 ms	4 MB
clang++	rndmini12	AC	2 ms	4 MB
clang++	rndmini13	AC	2 ms	4 MB
clang++	rndmini14	AC	2 ms	4 MB
clang++	rndmini15	AC	2 ms	4 MB
clang++	rndmini2	AC	2 ms	4 MB
clang++	rndmini3	AC	2 ms	4 MB
clang++	rndmini4	AC	2 ms	4 MB
clang++	rndmini5	AC	2 ms	4 MB
clang++	rndmini6	AC	2 ms	4 MB
clang++	rndmini7	AC	2 ms	4 MB
clang++	rndmini8	AC	2 ms	4 MB
clang++	rndmini9	AC	2 ms	4 MB
clang++	tree1	AC	4 ms	4 MB
clang++	tree2	AC	3 ms	4 MB
clang++	tree3	AC	4 ms	4 MB
clang++	tree4	AC	3 ms	4 MB
clang++	tree5	AC	3 ms	4 MB
clang++	tree_halfsame	AC	4 ms	4 MB
clang++	tree_same	AC	4 ms	4 MB
clang++	unique1	AC	5 ms	4 MB
clang++	unique2	AC	5 ms	4 MB
clang++	unique3	AC	2 ms	4 MB
clang++	unique4	AC	4 ms	4 MB
clang++	unique5	AC	5 ms	4 MB
clang++	uniquebig1	AC	3 ms	4 MB
clang++	uniquebig2	AC	4 ms	4 MB

Back to top page