Submission #58383

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
// author: r1933
// verify "dijkstra"
#include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
template <class T>
using MaxHeap = priority_queue<T, vector<T>, less<T>>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class T>
inline void input(vector<T> &vec) {
for (auto &e: vec) {
cin >> e;
}
}
template <class T>
inline void input(vector<vector<T>> &mat) {
for (auto &vec: mat) {
input(vec);
}
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) cout << " ";
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream& operator<<(ostream &strm, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e: vec) {
strm << e << delim[&e == &vec.back()];
}
return strm;
}
template <class T>
inline vector<T> make_v(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto make_v(const T &initValue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initValue, args...))>(sz, make_v<T>(initValue, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
// End Header }}}
// Edge {{{
template <class Weight>
struct Edge {
size_t from, to;
Weight weight;
Edge() {}
Edge(size_t from, size_t to, Weight weight = 1) :
from(from), to(to), weight(weight)
{}
bool operator<(const Edge &rhs) const {
return weight < rhs.weight;
}
bool operator>(const Edge &rhs) const {
return weight > rhs.weight;
}
operator size_t() const {
return to;
}
};
// }}}
// Graph {{{
template <class Weight>
class Graph : public vector<vector<Edge<Weight>>> {
using graph = vector<vector<Edge<Weight>>>;
public:
Graph() {}
Graph(const size_t V) : graph(V) {}
void connect(size_t from, size_t to, size_t weight = 1) {
(*this)[from].emplace_back(from, to, weight);
}
friend ostream& operator<<(ostream &strm, const Graph &G) {
for (size_t v = 0; v < G.size(); ++v) {
strm << '[' << setw(2) << v << ']';
for (const auto &e: G[v]) {
strm << ' ' << setw(2) << e.to;
}
strm << '\n';
}
return strm;
}
};
// }}}
// dijkstra {{{
template <class Weight>
vector<Weight> dijkstra(const Graph<Weight> &G, const vector<size_t> &startNodes) {
using P = pair<Weight, size_t>;
vector<Weight> dp(G.size(), numeric_limits<Weight>::max());
priority_queue<P, vector<P>, greater<>> pq;
for (const auto startNode: startNodes) {
dp[startNode] = 0;
pq.emplace(0, startNode);
}
while (!pq.empty()) {
const Weight nowCost = pq.top().first;
const size_t nowNode = pq.top().second;
pq.pop();
if (dp[nowNode] < nowCost) {
continue;
}
for (const auto &e: G[nowNode]) {
const Weight newCost = dp[nowNode] + e.weight;
const size_t newNode = e.to;
if (newCost < dp[newNode]) {
dp[newNode] = newCost;
pq.emplace(newCost, newNode);
}
}
}
return dp;
}
// }}}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
var(size_t, V, E);
Graph<size_t> G(V);
rep(i, E) {
var(size_t, from, to, cost);
from--, to--;
G.connect(from, to, cost);
G.connect(to, from, cost);
}
const auto dist = dijkstra(G, {0});
if (dist[V - 1] == SIZE_MAX) {
print("NA");
} else {
print(dist[V - 1]);
}
return 0;
}

ステータス

項目 データ
問題 0431 - 君も始めようダイクストラ大好き厨
ユーザー名 もけ
投稿日時 2020-02-02 22:55:12
言語 C++17
状態 Accepted
得点 1
ソースコード長 5583 Byte
最大実行時間 88 ms
最大メモリ使用量 12760 KB

セット

セット 得点 Cases
1 ALL 1 / 1 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
m_in1.txt AC 88 ms 12760 KB
1
r_in1.txt AC 26 ms 2820 KB
1
r_in2.txt AC 30 ms 2876 KB
1
r_in3.txt AC 31 ms 3096 KB
1
r_in4.txt AC 26 ms 2160 KB
1
r_in5.txt AC 29 ms 3664 KB
1
r_in6.txt AC 32 ms 3236 KB
1
r_in7.txt AC 24 ms 1728 KB
1
r_in8.txt AC 23 ms 1884 KB
1
r_in9.txt AC 32 ms 3692 KB
1
r_in10.txt AC 22 ms 1504 KB
1
r_in11.txt AC 27 ms 2564 KB
1
r_in12.txt AC 33 ms 2724 KB
1
r_in13.txt AC 30 ms 2884 KB
1
r_in14.txt AC 32 ms 3040 KB
1
r_in15.txt AC 30 ms 3204 KB
1
r_in16.txt AC 30 ms 2220 KB
1
r_in17.txt AC 24 ms 2364 KB
1
r_in18.txt AC 26 ms 2388 KB
1
r_in19.txt AC 26 ms 1532 KB
1
r_in20.txt AC 23 ms 2076 KB
1
r_in21.txt AC 21 ms 1196 KB
1
r_in22.txt AC 23 ms 1400 KB
1
r_in23.txt AC 22 ms 1556 KB
1
r_in24.txt AC 27 ms 1676 KB
1
r_in25.txt AC 30 ms 1888 KB
1
r_in26.txt AC 29 ms 2124 KB
1
r_in27.txt AC 29 ms 2268 KB
1
r_in28.txt AC 27 ms 2408 KB
1
r_in29.txt AC 29 ms 2552 KB
1
r_in30.txt AC 27 ms 2668 KB
1