/
d.cc
297 lines (260 loc) · 7.18 KB
/
d.cc
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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
/*
URL https://beta.atcoder.jp/contests/abc079/tasks/abc079_d
SCORE 400
AC true
WA false
TLE false
MLE false
TASK_TYPE グラフ 最短経路 ワーシャルフロイド
FAILURE_TYPE
NOTES
コストの計算をグラフと最短経路でとく
*/
#include <iostream>
#include <cstdint>
#include <utility>
#include <tuple>
#include <vector>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <limits>
#include <numeric>
#include <iomanip>
using namespace std;
// Type aliases
using i8 = int8_t; using u8 = uint8_t;
using i16 = int16_t; using u16 = uint16_t;
using i32 = int32_t; using u32 = uint32_t;
using i64 = int64_t; using u64 = uint64_t;
template <class T> using V = vector<T>;
// Loops
#define REP(i, n) for (i64 i = 0; i < (n); ++i)
#define REPR(i, n) for (i64 i = (n) - 1; i >= 0; --i)
#define FOR(i, n, m) for (i64 i = (n); i < (m); ++i)
#define FORR(i, n, m) for (i64 i = (m) - 1; i >= (n); --i)
#define FORE(x, xs) for (auto &x: (xs))
// Macros
#define CTR(x) (x).begin(), (x).end()
// Utils for Tuple
namespace tuple_utils {
template<size_t...> struct seq{};
template<size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...>{};
template<size_t... Is>
struct gen_seq<0, Is...> : seq<Is...>{};
template <class Tuple, size_t... Is>
void read(istream &stream, Tuple &t, seq<Is...>) {
static_cast<void>((int[]){0, (void(stream >> get<Is>(t)), 0)...});
}
template<class Tuple, size_t... Is>
void print(ostream& stream, Tuple const& t, seq<Is...>) {
static_cast<void>((int[]){0, (void(stream << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...});
}
template <size_t I, class F, class A, class... Elems>
struct ForEach {
void operator()(A &arg, tuple<Elems...> const& t) const {
F()(arg, get<I>(t));
ForEach<I - 1, F, A, Elems...>()(arg, t);
};
void operator()(A &arg, tuple<Elems...>& t) const {
F()(arg, get<I>(t));
ForEach<I - 1, F, A, Elems...>()(arg, t);
};
};
template <class F, class A, class... Elems>
struct ForEach<0, F, A, Elems...> {
void operator()(A &arg, tuple<Elems...> const& t) const {
F()(arg, get<0>(t));
};
void operator()(A &arg, tuple<Elems...>& t) const {
F()(arg, get<0>(t));
};
};
template <class F, class A, class... Elems>
void for_each(A &arg, tuple<Elems...> const& t) {
ForEach<tuple_size<tuple<Elems...>>::value - 1, F, A, Elems...>()(arg, t);
};
template <class F, class A, class... Elems>
void for_each(A &arg, tuple<Elems...>& t) {
ForEach<tuple_size<tuple<Elems...>>::value - 1, F, A, Elems...>()(arg, t);
};
struct hash_for_element {
template <class V>
void operator()(size_t &size, const V& v) const {
size ^= hash<V>()(v);
}
};
}
// Input
template <class F, class S>
istream &operator>>(istream &stream, pair<F, S> &pair) {
stream >> pair.first;
stream >> pair.second;
return stream;
}
template <class ...Args>
istream &operator>>(istream &stream, tuple<Args...> &tuple) {
tuple_utils::read(stream, tuple, tuple_utils::gen_seq<sizeof...(Args)>());
return stream;
}
template <class T>
T read() {
T t;
cin >> t;
return t;
}
template <class F, class S>
pair<F, S> read() {
pair<F, S> p;
cin >> p;
return p;
}
template <class T1, class T2, class T3, class ...Args>
tuple<T1, T2, T3, Args...> read() {
tuple<T1, T2, T3, Args...> t;
cin >> t;
return t;
}
template <class T>
V<T> read(const int length) {
V<T> ts(length);
for (auto& t: ts) {
cin >> t;
}
return ts;
}
template <class F, class S>
V<pair<F, S>> read(const int length) {
V<pair<F, S>> ps(length);
for (auto& p: ps) {
cin >> p;
}
return ps;
}
template <class T1, class T2, class T3, class ...Args>
V<tuple<T1, T2, T3, Args...>> read(const int length) {
V<tuple<T1, T2, T3, Args...>> ts(length);
for (auto& t: ts) {
cin >> t;
}
return ts;
}
// Output
namespace debug {
template <class F, class S>
ostream &operator<<(ostream& stream, const pair<F, S> &pair) {
stream << "{" << pair.first << ", " << pair.second << "}";
return stream;
}
template <class ...Args>
ostream &operator<<(ostream& stream, const tuple<Args...> &tuple) {
stream << "{";
tuple_utils::print(stream, tuple, tuple_utils::gen_seq<sizeof...(Args)>());
stream << "}";
return stream;
}
template <class Iterator>
struct Container {
Container(const Iterator &begin, const Iterator &end) : begin(begin), end(end) {}
const Iterator &begin;
const Iterator &end;
};
template <class Iterator>
Container<Iterator> container(const Iterator &begin, const Iterator &end) {
return Container<Iterator>(begin, end);
}
template <class Iterator>
ostream &operator<<(ostream &stream, const Container<Iterator> &container) {
stream << "[";
size_t cnt = 0;
for (auto it = container.begin; it != container.end; ++it) {
stream << *it;
stream << "," << ((cnt % 10 == 9) ? "\n " : "\t");
cnt += 1;
}
stream << "\b\b]";
return stream;
}
template <class T, class Alloc>
ostream &operator<<(ostream& stream, const vector<T, Alloc> &vector) {
return stream << container(vector.begin(), vector.end());
}
}
// Hash
namespace std {
template <class F, class S>
struct hash<pair<F, S>> {
size_t operator ()(const pair<F, S> &p) const {
return hash<F>()(p.first) ^ hash<S>()(p.second);
}
};
template <class ...Args>
struct hash<tuple<Args...>> {
size_t operator ()(const tuple<Args...> &t) const {
size_t retval = 0;
tuple_utils::for_each<tuple_utils::hash_for_element, size_t, Args...>(retval, t);
return retval;
}
};
}
#define MAIN
void body();
// main function (DO NOT EDIT)
int main (int argc, char **argv) {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed;
body();
return 0;
}
#include <vector>
#include <unordered_map>
#include <experimental/optional>
#ifndef MAIN
#include "common.cc"
#endif
void body() {
using namespace debug;
auto H = read<i32>();
auto W = read<i32>();
V<V<i32>> cs(10, V<i32>(10, 0));
REP (i, 10) {
REP (j, 10) {
cs[i][j] = read<i32>();
}
}
V<V<i32>> As(H, V<i32>(W, 0));
REP (i, H) {
REP (j, W) {
As[i][j] = read<i32>();
}
}
// Warshall Floyd
V<V<i32>> cost(10, V<i32>(10, 1e5));
REP (i, 10) {
cost[i][i] = 0;
REP (j, 10) {
cost[i][j] = cs[i][j];
}
}
REP (k, 10) {
REP (i, 10) {
REP (j, 10) {
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
}
}
}
u64 ans = 0;
REP (i, H) {
REP (j, W) {
auto A = As[i][j];
if (A != -1) {
ans += cost[A][1];
}
}
}
cout << ans << endl;
}