/tmp/solutions/build/vertex_add_subtree_sum-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |constexpr int N = 5e5;
7| |
8| |int a[N];
9| |int p[N];
10| |int l[N];
11| |u64 b[N + 1];
12| |
13| |} // namespace
14| |
15| 1|int main() {
16| 1| rd rd;
17| 1| wt wt;
18| 1| int n = rd.uh();
19| 1| int q = rd.uh();
20| 1|#ifdef LOCAL
21| 1| std::memset(l, 0, 4 * n);
22| 1|#endif
23| 500k| for (int i = 0; i < n; ++i) a[i] = rd.uw();
^500k^500k
------------------
| Branch (23:19): [True: 100.00%, False: 0.00%]
------------------
24| 500k| for (int i = 1; i < n; ++i) p[i] = rd.uh();
^499k^499k
------------------
| Branch (24:19): [True: 100.00%, False: 0.00%]
------------------
25| 500k| for (int i = n - 1; i > 0; --i) l[p[i]] += (l[i] += 1);
^499k^499k
------------------
| Branch (25:23): [True: 100.00%, False: 0.00%]
------------------
26| 1| l[0] = p[0] = n;
27| 500k| for (int i = 1; i < n; ++i) {
^499k
------------------
| Branch (27:19): [True: 100.00%, False: 0.00%]
------------------
28| 499k| int j = p[i];
29| 499k| int li = l[i];
30| 499k| int lj = l[j];
31| 499k| l[i] = p[i] = lj;
32| 499k| l[j] -= li;
33| 499k| }
34| 500k| for (int i = 0; i < n; ++i) b[l[i]] = a[i];
^500k^500k
------------------
| Branch (34:19): [True: 100.00%, False: 0.00%]
------------------
35| 500k| for (int i = 1; i <= n; ++i) b[i] += b[i - 1];
^500k^500k
------------------
| Branch (35:19): [True: 100.00%, False: 0.00%]
------------------
36| 500k| for (int i = n; i >= 1; --i) b[i] -= b[i - (i & -i)];
^500k^500k
------------------
| Branch (36:19): [True: 100.00%, False: 0.00%]
------------------
37| 500k| while (q--) {
------------------
| Branch (37:10): [True: 100.00%, False: 0.00%]
------------------
38| 500k| let t = rd.u1();
39| 500k| if (t == 0) {
------------------
| Branch (39:9): [True: 50.01%, False: 49.99%]
------------------
40| 250k| int k = l[rd.uh()];
41| 250k| int x = rd.uw();
42| 2.64M| for (; k <= n; k += k & -k) b[k] += x;
^2.39M ^2.39M
------------------
| Branch (42:14): [True: 90.56%, False: 9.44%]
------------------
43| 250k| }
44| 500k| if (t == 1) {
------------------
| Branch (44:9): [True: 49.99%, False: 50.01%]
------------------
45| 249k| int x = rd.uh();
46| 249k| int L = l[x] - 1;
47| 249k| int R = p[x];
48| 249k| u64 sum = 0;
49| 2.59M| for (; L > 0; L -= L & -L) sum -= b[L];
^2.34M ^2.34M
------------------
| Branch (49:14): [True: 90.37%, False: 9.63%]
------------------
50| 1.99M| for (; R > 0; R -= R & -R) sum += b[R];
^1.74M ^1.74M
------------------
| Branch (50:14): [True: 87.50%, False: 12.50%]
------------------
51| 249k| wt.ud(sum);
52| 249k| }
53| 500k| }
54| 1| return 0;
55| 1|}