Test/Graph/Normal/Dijkstra.test.cpp

View this file on GitHub
Last update: 2025-06-14 20:53:47+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/1/GRL_1_A

Depends on

Code

#define PROBLEM \
  "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/1/GRL_1_A"

#include "./../../../Library/Graph/Normal/dijkstra.hpp"


#include <iostream>


#include "./../../../Library/Graph/Graph.hpp"


using ll = long long;
using std::cin;
using std::cout;
constexpr char endl = '\n';

signed main() {
  int n, m, r;
  cin >> n >> m >> r;

  auto graph = mtd::Graph(n);
  for (int i = 0; i < m; ++i) {
    int u, v, c;
    cin >> u >> v >> c;
    graph.addArc(u, v, c);
  }

  auto min_cost = mtd::dijkstra(graph, r);

  for (const auto x : min_cost) {
    if (x > 1e17) {
      cout << "INF" << endl;
    } else {
      cout << x << endl;
    }
  }
}

#line 1 "Test/Graph/Normal/Dijkstra.test.cpp"
#define PROBLEM \
  "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/1/GRL_1_A"

#line 2 "Library/Graph/Normal/dijkstra.hpp"

#include <concepts>
#include <queue>
#include <vector>

#line 2 "Library/Graph/Graph.hpp"
#include <deque>

#include <iostream>

#include <ranges>

#include <tuple>

#line 7 "Library/Graph/Graph.hpp"

namespace mtd {
  template <class Node = long long, class Cost = long long>
  class Graph {
    using Edge = std::pair<Node, Cost>;
    using Edges = std::vector<Edge>;

    const int m_n;
    std::vector<Edges> m_graph;

  public:
    Graph(int n) : m_n(n), m_graph(n) {}
    Graph(const std::vector<Edges>& edges)
        : m_n(edges.size()), m_graph(edges) {}
    Graph(int n, const std::vector<std::tuple<Node, Node>>& edges,
          bool is_arc = false, bool is_index1 = true)
        : Graph<Node, Cost>(n) {
      for (auto [u, v] : edges) {
        u -= is_index1;
        v -= is_index1;
        if (is_arc) {
          addArc(u, v);
        } else {
          addEdge(u, v);
        }
      }
    }
    Graph(int n, const std::vector<std::tuple<Node, Node, Cost>>& edges,
          bool is_arc = false, bool is_index1 = true)
        : Graph<Node, Cost>(n) {
      for (auto [u, v, c] : edges) {
        u -= is_index1;
        v -= is_index1;
        if (is_arc) {
          addArc(u, v, c);
        } else {
          addEdge(u, v, c);
        }
      }
    }

    auto addEdge(const Node& f, const Node& t, const Cost& c = 1) {
      addArc(f, t, c);
      addArc(t, f, c);
    }
    auto addArc(const Node& f, const Node& t, const Cost& c = 1) {
      m_graph[f].emplace_back(t, c);
    }
    auto getEdges(const Node& from) const {
      class EdgesRange {
        const typename Edges::const_iterator b, e;

      public:
        EdgesRange(const Edges& edges) : b(edges.begin()), e(edges.end()) {}
        auto begin() const { return b; }
        auto end() const { return e; }
      };
      return EdgesRange(m_graph[from]);
    }
    auto getEdges() const {
      std::deque<std::tuple<Node, Node, Cost>> edges;
      for (Node from : std::views::iota(0, m_n)) {
        for (const auto& [to, c] : getEdges(from)) {
          edges.emplace_back(from, to, c);
        }
      }
      return edges;
    }
    auto getEdgesExcludeCost() const {
      std::deque<std::pair<Node, Node>> edges;
      for (Node from : std::views::iota(0, m_n)) {
        for (const auto& [to, _] : getEdges(from)) {
          edges.emplace_back(from, to);
        }
      }
      return edges;
    }
    auto reverse() const {
      auto rev = Graph<Node, Cost>(m_n);
      for (const auto& [from, to, c] : getEdges()) { rev.addArc(to, from, c); }
      return rev;
    }
    auto size() const { return m_n; };
    auto debug(bool directed = false) const {
      for (const auto& [f, t, c] : getEdges()) {
        if (f < t || directed) {
          std::cout << f << " -> " << t << ": " << c << std::endl;
        }
      }
    }
  };
}  // namespace mtd

#line 8 "Library/Graph/Normal/dijkstra.hpp"

namespace mtd {
  template <class Node, class Cost, std::convertible_to<Node> _Node>
  auto dijkstra(const Graph<Node, Cost>& graph, const _Node& begin,
                const Cost& lim = 1LL << 62) {
    std::vector<Cost> cost(graph.size(), lim);
    cost[begin] = 0;

    using P = std::pair<Cost, Node>;
    std::priority_queue<P, std::vector<P>, std::greater<P>> q;
    q.emplace(cost[begin], begin);
    while (!q.empty()) {
      auto [now_cost, from] = q.top();
      q.pop();
      if (cost[from] < now_cost) { continue; }
      for (const auto& [to, c] : graph.getEdges(from)) {
        if (now_cost + c < cost[to]) {
          cost[to] = now_cost + c;
          q.emplace(cost[to], to);
        }
      }
    }
    return cost;
  }
}  // namespace mtd
#line 5 "Test/Graph/Normal/Dijkstra.test.cpp"

#line 7 "Test/Graph/Normal/Dijkstra.test.cpp"

#line 9 "Test/Graph/Normal/Dijkstra.test.cpp"

using ll = long long;
using std::cin;
using std::cout;
constexpr char endl = '\n';

signed main() {
  int n, m, r;
  cin >> n >> m >> r;

  auto graph = mtd::Graph(n);
  for (int i = 0; i < m; ++i) {
    int u, v, c;
    cin >> u >> v >> c;
    graph.addArc(u, v, c);
  }

  auto min_cost = mtd::dijkstra(graph, r);

  for (const auto x : min_cost) {
    if (x > 1e17) {
      cout << "INF" << endl;
    } else {
      cout << x << endl;
    }
  }
}