aoj-grl-1-a-fast-dijkstra.test.cpp

#define PROBLEM \
  "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A"

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

using namespace Nyaan; void Nyaan::solve() {
  ini(N, E, S);
  StaticGraph<int> g(N, E);
  rep(i, E) {
    ini(s, t, d);
    g.add_edge(s, t, d);
  }
  auto d = dijkstra(g, S);
  d.resize(N);
  each(x, d) {
    if (x == -1)
      out("INF");
    else
      out(x);
  }
}