Submission #68333

ソースコード

?
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
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define all(x) begin(x), end(x)
#define Fixed fixed << setprecision(12)
#define int int32_t
using pii = pair<int,int>;
constexpr int32_t INF = 0x3f3f3f3f;
constexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9+7;
constexpr int mod2 = 998244353;
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 A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;
template <class A, class B> using umap = unordered_map<A,B>;
template <class T> inline void bye(T x) { cout << x << '\n'; exit(0); }
inline int square(int a){ return a * a;}
inline int updiv(int a,int b){ return (a + b - 1) / b; }
constexpr int dx[] = {1,0,-1,0,1,1,-1,-1};
constexpr int dy[] = {0,-1,0,1,1,-1,-1,1};
struct HeavyLightDecomposition {
public:
vector<vector<int> > g;
vector<int> sz, in, out, head, rev, par, dep;
HeavyLightDecomposition(const vector<vector<int> > &G) : g(G) {
sz.resize(g.size(), 0);
in.resize(g.size(), 0);
out.resize(g.size(), 0);
head.resize(g.size(), 0);
rev.resize(g.size(), 0);
par.resize(g.size(), 0);
dep.resize(g.size(), 0);
dfs_sz(0, -1, 0);
dfs_hld(0, -1);
}
// 頂点vからk個遡った頂点
int la(int v, int k) {
while (true) {
int u = head[v];
if (in[v] - k >= in[u]) return (rev[in[v] - k]);
k -= in[v] - in[u] + 1;
v = par[u];
}
}
int lca(int u, int v) const {
for (;; v = par[head[v]]) {
if (in[u] > in[v]) swap(u, v);
if (head[u] == head[v]) return (u);
}
}
int dist(int u, int v) const {
return (dep[u] + dep[v] - 2 * dep[lca(u, v)]);
}
template<typename E, typename F, typename G, typename S>
E query(int u, int v, const E &ti, const F &f, const G &g, const S &s, bool edge = false) {
E l = ti, r = ti;
for (;; v = par[head[v]]) {
if (in[u] > in[v]) swap(u, v), swap(l, r);
if (head[u] == head[v]) break;
l = g(f(in[head[v]], in[v] + 1), l);
}
return (s(g(f(in[u] + edge, in[v] + 1), l), r));
}
template<typename E, typename F, typename G>
E query(int u, int v, const E &ti, const F &f, const G &g, bool edge = false) {
return (query(u, v, ti, f, g, g, edge));
}
template<typename G>
void update(int u, int v, const G &g, bool edge = false) {
for (;; v = par[head[v]]) {
if (in[u] > in[v]) swap(u, v);
if (head[u] == head[v]) break;
g(in[head[v]], in[v] + 1);
}
g(in[u] + edge, in[v] + 1);
}
/* {parent, child} */
vector<pair<int, int> > compress(vector<int> &remark) {
auto comp = [&](int a, int b) { return (in[a] < in[b]); };
sort(begin(remark), end(remark), comp);
remark.erase(unique(begin(remark), end(remark)), end(remark));
int K = (int) remark.size();
for (int k = 1; k < K; ++k) remark.emplace_back(lca(remark[k - 1], remark[k]));
sort(begin(remark), end(remark), comp);
remark.erase(unique(begin(remark), end(remark)), end(remark));
vector<pair<int, int> > es;
vector<int> st;
for (auto &k : remark) {
while (!st.empty() && out[st.back()] <= in[k]) st.pop_back();
if (!st.empty()) es.emplace_back(st.back(), k);
st.emplace_back(k);
}
return (es);
}
private:
void dfs_sz(int cur, int p, int d) {
dep[cur] = d;
par[cur] = p;
sz[cur] = 1;
if (!g[cur].empty() && g[cur][0] == p) swap(g[cur][0], g[cur].back());
for (auto &to : g[cur]) {
if (to == p) continue;
dfs_sz(to, cur, d + 1);
sz[cur] += sz[to];
if (sz[g[cur][0]] < sz[to]) swap(g[cur][0], to);
}
}
void dfs_hld(int cur, int p) {
static int times = 0;
in[cur] = times++;
rev[in[cur]] = cur;
for (auto &to : g[cur]) {
if (to == p) continue;
head[to] = (g[cur][0] == to ? head[cur] : to);
dfs_hld(to, cur);
}
out[cur] = times;
}
};
template< typename Monoid, typename F >
struct SegmentTree {
int n, sz;
vector< Monoid > seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : n(n), f(f), M1(M1) {
sz = 1;
while(sz < n) sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) {
seg[k + sz] = x;
}
void build() {
for(int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while(k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if(a & 1) L = f(L, seg[a++]);
if(b & 1) R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const {
return seg[k + sz];
}
template< typename C >
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while(a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if(check(nxt)) a = 2 * a + type;
else M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template< typename C >
int find_first(int a, const C &check) {
Monoid L = M1;
if(a <= 0) {
if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
return n;
}
int b = sz;
for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if(a & 1) {
Monoid nxt = f(L, seg[a]);
if(check(nxt)) return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return n;
}
template< typename C >
int find_last(int b, const C &check) {
Monoid R = M1;
if(b >= sz) {
if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for(b += sz; a < b; a >>= 1, b >>= 1) {
if(b & 1) {
Monoid nxt = f(seg[--b], R);
if(check(nxt)) return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
template< typename Monoid, typename F >
SegmentTree< Monoid, F > get_segment_tree(int N, const F& f, const Monoid& M1) {
return {N, f, M1};
}
signed main(void){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<vector<int> > tree(n);
vector<vector<pair<int, int> > > graph(n);
map<pair<int, int>, int64_t> cost;
for (int i = 0; i < n - 1; ++i) {
int a, b, c;
cin >> a >> b >> c;
tree[a].emplace_back(b);
tree[b].emplace_back(a);
graph[a].emplace_back(b, c);
graph[b].emplace_back(a, c);
cost[minmax(a, b)] = c;
}
HeavyLightDecomposition hld(tree);
auto seg = get_segment_tree(n, [](auto a, auto b) { return (a + b); }, 0LL);
for (int i = 1; i < n; ++i) {
int c = cost[minmax(hld.par[i], i)];
if (c % k == 0) c = 0;
seg.set(hld.in[i], c);
}
seg.build();
int q;
cin >> q;
vector<int_fast64_t> sum(n);
vector<int> idx(n);
vector<tuple<string, int, int> > queries;
unordered_set<int> us;
int u, v, x, y, to, c;
string com;
for (int i = 0; i < q; ++i) {
string com;
cin >> com;
if (com == "add") {
int x, d;
cin >> x >> d;
// nodes.emplace_back(x);
us.insert(x);
queries.emplace_back(com, x, d);
} else {
int s, t;
cin >> s >> t;
// nodes.emplace_back(s);
// nodes.emplace_back(t);
us.insert(s);
us.insert(t);
queries.emplace_back(com, s, t);
}
if (i == q - 1 || us.size() >= 100) {
vector<int> nodes;
for (auto e: us) nodes.emplace_back(e);
auto edges = hld.compress(nodes);
int sz = nodes.size();
for (int i = 0; i < sz; ++i) {
idx[nodes[i]] = i;
}
vector<vector<int> > g(sz);
for (int l = 0; l < edges.size(); ++l) {
tie(u, v) = edges[l];
g[idx[u]].emplace_back(idx[v]);
g[idx[v]].emplace_back(idx[u]);
}
for (int l = 0; l < queries.size(); ++l) {
tie(com, x, y) = queries[l];
if (com == "add") {
sum[x] += y;
} else {
vector<int> nv;
makeFixPoint([&](auto rec, auto cur, auto par) -> bool {
nv.emplace_back(nodes[cur]);
if (cur == idx[y]) {
return (true);
} else {
for (auto to: g[cur]) {
if (par == to) continue;
if (rec(to, cur)) return (true);
}
}
nv.pop_back();
return (false);
})(idx[x], -1);
int vs = nv.size();
int_fast64_t res = 0;
for (int j = 0; j < vs - 1; ++j) {
int u = nv[j], v = nv[j + 1];
if (hld.in[u] > hld.in[v]) swap(u, v);
auto f = [&](int a, int b) { return (seg.query(a, b)); };
auto g = [](int a, int b) { return (a + b); };
res += hld.query(u, v, 0LL, f, g, true);
int vh = hld.la(v, 1);
int vc = cost[minmax(v, vh)] + sum[v] + sum[vh];
res -= seg[hld.in[v]];
if (vc % k != 0) res += vc;
if (vh != u) {
int ul = hld.la(v, hld.dist(u, v) - 1);
int uc = cost[minmax(u, ul)] + sum[u] + sum[ul];
res -= seg[hld.in[ul]];
if (uc % k != 0) res += uc;
}
}
cout << res << '\n';
}
}
for (auto e : nodes) {
if (sum[e] == 0) continue;
for (int l = 0; l < graph[e].size(); ++l) {
tie(to, c) = graph[e][l];
int u = e, v = to;
if (hld.in[u] > hld.in[v]) swap(u, v);
if ((cost[minmax(u, v)] += sum[e]) % k == 0) c = 0;
else c = cost[minmax(u, v)];
seg.update(hld.in[v], c);
}
sum[e] = 0;
}
queries.clear();
us.clear();
}
}
return (0);
}

ステータス

項目 データ
問題 0965 - ネットワークの課金システム
ユーザー名 ei1903
投稿日時 2021-09-06 18:48:26
言語 C++17
状態 Accepted
得点 17
ソースコード長 12569 Byte
最大実行時間 3606 ms
最大メモリ使用量 39760 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in1.txt AC 19 ms 476 KB
1
in2.txt AC 22 ms 3384 KB
1
in3.txt AC 22 ms 3384 KB
1
in4.txt AC 18 ms 3324 KB
1
in5.txt AC 29 ms 3396 KB
1
in6.txt AC 24 ms 3444 KB
1
in7.txt AC 22 ms 3476 KB
1
in8.txt AC 19 ms 3496 KB
1
in9.txt AC 61 ms 6432 KB
1
in10.txt AC 87 ms 3756 KB
1
in11.txt AC 93 ms 10612 KB
1
in12.txt AC 236 ms 26660 KB
1
in13.txt AC 251 ms 29704 KB
1
in14.txt AC 143 ms 35804 KB
1
in15.txt AC 181 ms 33896 KB
1
in16.txt AC 680 ms 32676 KB
1
in17.txt AC 3606 ms 39504 KB
1
in18.txt AC 1657 ms 36088 KB
1
in19.txt AC 579 ms 32744 KB
1
in20.txt AC 258 ms 32772 KB
1
in21.txt AC 270 ms 39760 KB
1