Submission #66437

ソースコード

?
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
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
// Begin Header {{{
#pragma region
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(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__)
#define let const auto
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;
using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream &is, Container &vs) {
for (auto &v: vs) is >> v;
return is;
}
template <class T, class U>
inline istream& operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) cout << " ";
output(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream &os, const Container &vs) {
static constexpr const char *delim[] = {" ", ""};
for (auto it = begin(vs); it != end(vs); ++it) {
os << delim[it == begin(vs)] << *it;
}
return os;
}
template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {
for (auto it = Begin; it != End; ++it) {
cout << ((it == Begin) ? "" : delim) << *it;
}
cout << last;
}
template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
return vector<T>(sz, init_value);
}
template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, 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 Container>
struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() { return c.rbegin(); }
auto end() { return c.rend(); }
};
template <class Container>
auto reversed(Container &c) {
return reverse_t<Container>(c);
}
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;
}
void operator|=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs | rhs;
}
void operator&=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs & rhs;
}
void operator^=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs ^ rhs;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
#pragma endregion
// }}} 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, Weight 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;
}
};
// }}}
// DisjointSet {{{
struct DisjointSet {
const size_t n;
mutable vector<int> c;
explicit DisjointSet(const size_t n) : n(n), c(n, -1) {}
size_t size(size_t v) const {
assert(v < n);
return -c[root(v)];
}
size_t root(size_t v) const {
assert(v < n);
return (c[v] < 0) ? v : c[v] = root(c[v]);
}
bool connected(size_t u, size_t v) const {
assert(u < n);
assert(v < n);
return root(u) == root(v);
}
size_t unite(size_t u, size_t v) {
assert(u < n);
assert(v < n);
u = root(u);
v = root(v);
if (u == v) return u;
if (-c[u] < -c[v]) swap(u, v);
c[u] += c[v];
c[v] = u;
return u;
}
vector<vector<size_t>> groups() {
vector<size_t> roots(n), group_size(n);
for (size_t i = 0; i < n; ++i) {
roots[i] = root(i);
group_size[roots[i]]++;
}
vector<vector<size_t>> res(n);
for (size_t i = 0; i < n; ++i) {
res[i].reserve(group_size[i]);
}
for (size_t i = 0; i < n; ++i) {
res[roots[i]].emplace_back(i);
}
res.erase(
remove_if(res.begin(), res.end(),
[&](const auto& v) { return v.empty(); }),
res.end());
return res;
}
};
// }}}
signed main() {
ioinit();
var(int, N, T);
assert(1 <= N && N <= 1e5);
assert(1 <= T && T <= 100);
if (T == 1) assert(false);
Graph<usize> G(N);
DisjointSet ds(N);
rep(_, 0, N - 1) {
var(usize, u, v);
assert(1 <= u && u <= N);
assert(1 <= v && v <= N);
u--, v--;
G.connect(u, v);
G.connect(v, u);
ds.unite(u, v);
}
assert(ds.groups().size() == 1);
vector<imax> cs(N), ps(N);
rep(i, 0, N) {
input(cs[i], ps[i]);
assert(1 <= cs[i] && cs[i] <= 9);
assert(1 <= ps[i] && ps[i] <= 1e5);
}
vector<imax> ms(N);
let dfs = makeFixPoint([&](auto rec, int cur, int par) -> imax {
int ret = 0;
for (let e: G[cur]) {
if (e.to == par) continue;
ret += rec(e.to, cur);
}
return ms[cur] = ret + 1;
});
dfs(0, -1);
imax res = 0;
makeFixPoint([&](auto rec, int cur, int par, imax num) -> void {
num = (num * 10 + cs[cur]) % T;
if (num == 0) res += ps[cur] * ms[cur];
for (let e: G[cur]) {
if (e.to == par) continue;
rec(e.to, cur, num);
}
})(0, -1, 0);
output(res);
return 0;
}

ステータス

項目 データ
問題 1497 - Walkin' on Numbered Tree
ユーザー名 syoribu
投稿日時 2021-05-03 23:52:46
言語 C++17
状態 Accepted
得点 400
ソースコード長 8498 Byte
最大実行時間 88 ms
最大メモリ使用量 21488 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
s-01_in.txt AC 25 ms 476 KB
1
s-02_in.txt AC 21 ms 432 KB
1
s-03_in.txt AC 23 ms 516 KB
1
s-04_in.txt AC 20 ms 596 KB
1
t-01_in.txt AC 26 ms 544 KB
1
t-02_in.txt AC 16 ms 500 KB
1
t-03_in.txt AC 21 ms 576 KB
1
t-04_in.txt AC 20 ms 652 KB
1
t-05_in.txt AC 17 ms 728 KB
1
t-06_in.txt AC 20 ms 676 KB
1
t-07_in.txt AC 20 ms 620 KB
1
t-08_in.txt AC 20 ms 560 KB
1
t-09_in.txt AC 21 ms 640 KB
1
t-10_in.txt AC 21 ms 596 KB
1
t-11_in.txt AC 15 ms 676 KB
1
t-12_in.txt AC 16 ms 668 KB
1
t-13_in.txt AC 17 ms 840 KB
1
t-14_in.txt AC 16 ms 700 KB
1
t-15_in.txt AC 20 ms 664 KB
1
t-16_in.txt AC 22 ms 676 KB
1
t-17_in.txt AC 23 ms 648 KB
1
t-18_in.txt AC 23 ms 660 KB
1
t-19_in.txt AC 28 ms 588 KB
1
t-20_in.txt AC 24 ms 564 KB
1
t-21_in.txt AC 21 ms 576 KB
1
t-22_in.txt AC 26 ms 688 KB
1
t-23_in.txt AC 27 ms 472 KB
1
t-24_in.txt AC 21 ms 516 KB
1
t-25_in.txt AC 21 ms 620 KB
1
t-26_in.txt AC 24 ms 604 KB
1
t-27_in.txt AC 21 ms 676 KB
1
t-28_in.txt AC 21 ms 656 KB
1
t-29_in.txt AC 19 ms 616 KB
1
t-30_in.txt AC 23 ms 676 KB
1
t-31_in.txt AC 25 ms 716 KB
1
t-32_in.txt AC 16 ms 600 KB
1
t-33_in.txt AC 25 ms 668 KB
1
t-34_in.txt AC 23 ms 680 KB
1
t-35_in.txt AC 23 ms 744 KB
1
t-36_in.txt AC 18 ms 684 KB
1
t-37_in.txt AC 21 ms 708 KB
1
t-38_in.txt AC 23 ms 768 KB
1
t-39_in.txt AC 21 ms 880 KB
1
t-40_in.txt AC 34 ms 2620 KB
1
t-41_in.txt AC 31 ms 4292 KB
1
t-42_in.txt AC 48 ms 8572 KB
1
t-43_in.txt AC 27 ms 4376 KB
1
t-44_in.txt AC 47 ms 7284 KB
1
t-45_in.txt AC 22 ms 1052 KB
1
t-46_in.txt AC 40 ms 7880 KB
1
t-47_in.txt AC 21 ms 880 KB
1
t-48_in.txt AC 23 ms 1256 KB
1
t-49_in.txt AC 59 ms 9992 KB
1
t-50_in.txt AC 44 ms 7088 KB
1
t-51_in.txt AC 26 ms 2748 KB
1
t-52_in.txt AC 35 ms 5764 KB
1
t-53_in.txt AC 61 ms 11416 KB
1
t-54_in.txt AC 15 ms 812 KB
1
t-55_in.txt AC 24 ms 2212 KB
1
t-56_in.txt AC 47 ms 7628 KB
1
t-57_in.txt AC 48 ms 8204 KB
1
t-58_in.txt AC 41 ms 6988 KB
1
t-59_in.txt AC 76 ms 13140 KB
1
t-60_in.txt AC 44 ms 7300 KB
1
t-61_in.txt AC 32 ms 1424 KB
1
t-62_in.txt AC 37 ms 6124 KB
1
t-63_in.txt AC 65 ms 12320 KB
1
t-64_in.txt AC 41 ms 4884 KB
1
t-65_in.txt AC 54 ms 10020 KB
1
t-66_in.txt AC 25 ms 1660 KB
1
t-67_in.txt AC 79 ms 14752 KB
1
t-68_in.txt AC 66 ms 12644 KB
1
t-69_in.txt AC 58 ms 11984 KB
1
t-70_in.txt AC 54 ms 10476 KB
1
t-71_in.txt AC 88 ms 15084 KB
1
t-72_in.txt AC 83 ms 15152 KB
1
t-73_in.txt AC 79 ms 15108 KB
1
t-74_in.txt AC 81 ms 15052 KB
1
t-75_in.txt AC 81 ms 15136 KB
1
t-76_in.txt AC 79 ms 15224 KB
1
t-77_in.txt AC 85 ms 15184 KB
1
t-78_in.txt AC 84 ms 15124 KB
1
t-79_in.txt AC 85 ms 15088 KB
1
t-80_in.txt AC 60 ms 21488 KB
1
t-81_in.txt AC 16 ms 868 KB
1
t-82_in.txt AC 22 ms 824 KB
1
t-83_in.txt AC 21 ms 784 KB
1
t-84_in.txt AC 23 ms 864 KB
1
t-85_in.txt AC 19 ms 820 KB
1
t-86_in.txt AC 17 ms 1032 KB
1
t-87_in.txt AC 50 ms 9392 KB
1
t-88_in.txt AC 66 ms 12328 KB
1
t-89_in.txt AC 58 ms 11132 KB
1
t-90_in.txt AC 75 ms 14052 KB
1