test/verify/yosupo-shortest-path.test.cpp

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Problem: https://judge.yosupo.jp/problem/shortest_path

Depends on

• Graph Template(グラフテンプレート) (graph/graph-template.hpp)
• Dijkstra(単一始点最短路) (graph/shortest-path/dijkstra.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shortest_path

#include "../../template/template.hpp"

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

int main() {
  int N, M, S, T;
  cin >> N >> M >> S >> T;
  Graph< int64 > g(N);
  g.read(M, 0, true, true);
  auto ret = dijkstra(g, S);
  if(ret.from[T] == -1) {
    cout << -1 << "\n";
  } else {
    cout << ret.dist[T] << " ";
    vector< pair< int, int > > es;
    while(S != T) {
      es.emplace_back(ret.from[T], T);
      T = ret.from[T];
    }
    reverse(begin(es), end(es));
    cout << es.size() << "\n";
    for(auto &p : es) cout << p.first << " " << p.second << "\n";
  }
}

#line 1 "test/verify/yosupo-shortest-path.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shortest_path

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/yosupo-shortest-path.test.cpp"

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

/**
 * @brief Graph Template(グラフテンプレート)
 */
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 {
  vector<vector<Edge<T> > > g;
  int es;

  Graph() = default;

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

  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;
      cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

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

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

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

#line 4 "graph/shortest-path/dijkstra.hpp"

/**
 * @brief Dijkstra(単一始点最短路)
 *
 */
template <typename T>
struct ShortestPath {
  vector<T> dist;
  vector<int> from, id;
};

template <typename T>
ShortestPath<T> dijkstra(const Graph<T> &g, int s) {
  const auto INF = numeric_limits<T>::max();
  vector<T> dist(g.size(), INF);
  vector<int> from(g.size(), -1), id(g.size(), -1);
  using Pi = pair<T, int>;
  priority_queue<Pi, vector<Pi>, greater<> > que;
  dist[s] = 0;
  que.emplace(dist[s], s);
  while (!que.empty()) {
    T cost;
    int idx;
    tie(cost, idx) = que.top();
    que.pop();
    if (dist[idx] < cost) continue;
    for (auto &e : g[idx]) {
      auto next_cost = cost + e.cost;
      if (dist[e.to] <= next_cost) continue;
      dist[e.to] = next_cost;
      from[e.to] = idx;
      id[e.to] = e.idx;
      que.emplace(dist[e.to], e.to);
    }
  }
  return {dist, from, id};
}
#line 7 "test/verify/yosupo-shortest-path.test.cpp"

int main() {
  int N, M, S, T;
  cin >> N >> M >> S >> T;
  Graph< int64 > g(N);
  g.read(M, 0, true, true);
  auto ret = dijkstra(g, S);
  if(ret.from[T] == -1) {
    cout << -1 << "\n";
  } else {
    cout << ret.dist[T] << " ";
    vector< pair< int, int > > es;
    while(S != T) {
      es.emplace_back(ret.from[T], T);
      T = ret.from[T];
    }
    reverse(begin(es), end(es));
    cout << es.size() << "\n";
    for(auto &p : es) cout << p.first << " " << p.second << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	almost_line_00	AC	187 ms	34 MB
g++	almost_line_01	AC	192 ms	34 MB
g++	almost_line_02	AC	182 ms	35 MB
g++	example_00	AC	7 ms	4 MB
g++	example_01	AC	6 ms	4 MB
g++	grid_random_00	AC	152 ms	25 MB
g++	grid_swirl_00	AC	167 ms	27 MB
g++	line_00	AC	284 ms	47 MB
g++	max_dense_long_00	AC	84 ms	18 MB
g++	max_dense_random_00	AC	84 ms	18 MB
g++	max_dense_random_01	AC	84 ms	18 MB
g++	max_dense_zero_00	AC	66 ms	18 MB
g++	max_sparse_random_00	AC	145 ms	34 MB
g++	max_sparse_random_01	AC	181 ms	35 MB
g++	max_sparse_random_02	AC	203 ms	35 MB
g++	max_star_00	AC	181 ms	51 MB
g++	max_star_01	AC	238 ms	48 MB
g++	small_00	AC	6 ms	4 MB
g++	small_01	AC	6 ms	4 MB
g++	small_02	AC	6 ms	4 MB
g++	small_03	AC	6 ms	4 MB
g++	small_04	AC	6 ms	4 MB
g++	sparse_random_00	AC	127 ms	38 MB
g++	sparse_random_01	AC	122 ms	42 MB
g++	sparse_random_02	AC	110 ms	21 MB
g++	spfa_killer_00	AC	197 ms	44 MB
g++	wrong_dijkstra_handmade_00	AC	6 ms	4 MB
g++	wrong_dijkstra_killer_00	AC	170 ms	35 MB
g++	wrong_dijkstra_killer_01	AC	246 ms	40 MB
clang++	almost_line_00	AC	218 ms	34 MB
clang++	almost_line_01	AC	204 ms	34 MB
clang++	almost_line_02	AC	194 ms	35 MB
clang++	example_00	AC	7 ms	4 MB
clang++	example_01	AC	6 ms	4 MB
clang++	grid_random_00	AC	162 ms	25 MB
clang++	grid_swirl_00	AC	181 ms	27 MB
clang++	line_00	AC	319 ms	47 MB
clang++	max_dense_long_00	AC	85 ms	18 MB
clang++	max_dense_random_00	AC	84 ms	18 MB
clang++	max_dense_random_01	AC	153 ms	18 MB
clang++	max_dense_zero_00	AC	66 ms	18 MB
clang++	max_sparse_random_00	AC	380 ms	34 MB
clang++	max_sparse_random_01	AC	176 ms	35 MB
clang++	max_sparse_random_02	AC	214 ms	35 MB
clang++	max_star_00	AC	182 ms	51 MB
clang++	max_star_01	AC	265 ms	49 MB
clang++	small_00	AC	6 ms	4 MB
clang++	small_01	AC	6 ms	4 MB
clang++	small_02	AC	6 ms	4 MB
clang++	small_03	AC	6 ms	4 MB
clang++	small_04	AC	6 ms	4 MB
clang++	sparse_random_00	AC	120 ms	38 MB
clang++	sparse_random_01	AC	124 ms	42 MB
clang++	sparse_random_02	AC	111 ms	22 MB
clang++	spfa_killer_00	AC	203 ms	44 MB
clang++	wrong_dijkstra_handmade_00	AC	7 ms	4 MB
clang++	wrong_dijkstra_killer_00	AC	166 ms	35 MB
clang++	wrong_dijkstra_killer_01	AC	263 ms	40 MB

Back to top page