This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A
#include "../../template/template.hpp"
#include "../../graph/shortest-path/dijkstra.hpp"
int main() {
int V, E, R;
cin >> V >> E >> R;
Graph< int > g(V);
g.read(E, 0, true, true);
for(auto &dist : dijkstra(g, R).dist) {
if(dist == numeric_limits< int >::max()) cout << "INF\n";
else cout << dist << "\n";
}
}
#line 1 "test/verify/aoj-grl-1-a.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A
#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/aoj-grl-1-a.test.cpp"
#line 2 "graph/shortest-path/dijkstra.hpp"
#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 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 6 "test/verify/aoj-grl-1-a.test.cpp"
int main() {
int V, E, R;
cin >> V >> E >> R;
Graph< int > g(V);
g.read(E, 0, true, true);
for(auto &dist : dijkstra(g, R).dist) {
if(dist == numeric_limits< int >::max()) cout << "INF\n";
else cout << dist << "\n";
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_sample_00.in | AC | 6 ms | 4 MB |
g++ | 00_sample_01.in | AC | 6 ms | 4 MB |
g++ | 01_small_00.in | AC | 6 ms | 4 MB |
g++ | 01_small_01.in | AC | 6 ms | 4 MB |
g++ | 02_medium_00.in | AC | 6 ms | 4 MB |
g++ | 02_medium_01.in | AC | 6 ms | 4 MB |
g++ | 03_corner_00.in | AC | 6 ms | 4 MB |
g++ | 03_corner_01.in | AC | 6 ms | 4 MB |
g++ | 03_corner_02.in | AC | 6 ms | 4 MB |
g++ | 03_corner_03.in | AC | 6 ms | 4 MB |
g++ | 04_rand_00.in | AC | 6 ms | 4 MB |
g++ | 04_rand_01.in | AC | 6 ms | 4 MB |
g++ | 04_rand_02.in | AC | 6 ms | 4 MB |
g++ | 04_rand_03.in | AC | 6 ms | 4 MB |
g++ | 05_linear_00.in | AC | 6 ms | 4 MB |
g++ | 05_linear_01.in | AC | 6 ms | 4 MB |
g++ | 05_linear_02.in | AC | 6 ms | 4 MB |
g++ | 05_linear_03.in | AC | 6 ms | 4 MB |
g++ | 06_ring_00.in | AC | 6 ms | 4 MB |
g++ | 06_ring_01.in | AC | 6 ms | 4 MB |
g++ | 06_ring_02.in | AC | 6 ms | 4 MB |
g++ | 06_ring_03.in | AC | 6 ms | 4 MB |
g++ | 07_large_00.in | AC | 6 ms | 4 MB |
g++ | 07_large_01.in | AC | 6 ms | 4 MB |
g++ | 07_large_02.in | AC | 7 ms | 4 MB |
g++ | 07_large_03.in | AC | 7 ms | 4 MB |
g++ | 08_large_00.in | AC | 8 ms | 4 MB |
g++ | 08_large_01.in | AC | 9 ms | 4 MB |
g++ | 08_large_02.in | AC | 10 ms | 5 MB |
g++ | 08_large_03.in | AC | 13 ms | 5 MB |
g++ | 09_maximum_00.in | AC | 57 ms | 11 MB |
g++ | 09_maximum_01.in | AC | 124 ms | 20 MB |
g++ | 09_maximum_02.in | AC | 35 ms | 11 MB |
g++ | 09_maximum_03.in | AC | 67 ms | 13 MB |
clang++ | 00_sample_00.in | AC | 7 ms | 4 MB |
clang++ | 00_sample_01.in | AC | 6 ms | 4 MB |
clang++ | 01_small_00.in | AC | 6 ms | 4 MB |
clang++ | 01_small_01.in | AC | 6 ms | 4 MB |
clang++ | 02_medium_00.in | AC | 6 ms | 4 MB |
clang++ | 02_medium_01.in | AC | 6 ms | 4 MB |
clang++ | 03_corner_00.in | AC | 6 ms | 4 MB |
clang++ | 03_corner_01.in | AC | 6 ms | 4 MB |
clang++ | 03_corner_02.in | AC | 6 ms | 4 MB |
clang++ | 03_corner_03.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_00.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_01.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_02.in | AC | 6 ms | 4 MB |
clang++ | 04_rand_03.in | AC | 6 ms | 4 MB |
clang++ | 05_linear_00.in | AC | 6 ms | 4 MB |
clang++ | 05_linear_01.in | AC | 6 ms | 4 MB |
clang++ | 05_linear_02.in | AC | 6 ms | 4 MB |
clang++ | 05_linear_03.in | AC | 6 ms | 4 MB |
clang++ | 06_ring_00.in | AC | 6 ms | 4 MB |
clang++ | 06_ring_01.in | AC | 6 ms | 4 MB |
clang++ | 06_ring_02.in | AC | 6 ms | 4 MB |
clang++ | 06_ring_03.in | AC | 6 ms | 4 MB |
clang++ | 07_large_00.in | AC | 6 ms | 4 MB |
clang++ | 07_large_01.in | AC | 6 ms | 4 MB |
clang++ | 07_large_02.in | AC | 7 ms | 4 MB |
clang++ | 07_large_03.in | AC | 8 ms | 4 MB |
clang++ | 08_large_00.in | AC | 9 ms | 4 MB |
clang++ | 08_large_01.in | AC | 9 ms | 4 MB |
clang++ | 08_large_02.in | AC | 10 ms | 5 MB |
clang++ | 08_large_03.in | AC | 13 ms | 5 MB |
clang++ | 09_maximum_00.in | AC | 56 ms | 11 MB |
clang++ | 09_maximum_01.in | AC | 125 ms | 20 MB |
clang++ | 09_maximum_02.in | AC | 34 ms | 11 MB |
clang++ | 09_maximum_03.in | AC | 65 ms | 13 MB |