/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| 6| for (int i = 0; i < n; ++i) a[i] = rd.uw();
^5 ^5
------------------
| Branch (23:19): [True: 83.33%, False: 16.67%]
------------------
24| 5| for (int i = 1; i < n; ++i) p[i] = rd.uh();
^4 ^4
------------------
| Branch (24:19): [True: 80.00%, False: 20.00%]
------------------
25| 5| for (int i = n - 1; i > 0; --i) l[p[i]] += (l[i] += 1);
^4 ^4
------------------
| Branch (25:23): [True: 80.00%, False: 20.00%]
------------------
26| 1| l[0] = p[0] = n;
27| 5| for (int i = 1; i < n; ++i) {
^4
------------------
| Branch (27:19): [True: 80.00%, False: 20.00%]
------------------
28| 4| int j = p[i];
29| 4| int li = l[i];
30| 4| int lj = l[j];
31| 4| l[i] = p[i] = lj;
32| 4| l[j] -= li;
33| 4| }
34| 6| for (int i = 0; i < n; ++i) b[l[i]] = a[i];
^5 ^5
------------------
| Branch (34:19): [True: 83.33%, False: 16.67%]
------------------
35| 6| for (int i = 1; i <= n; ++i) b[i] += b[i - 1];
^5 ^5
------------------
| Branch (35:19): [True: 83.33%, False: 16.67%]
------------------
36| 6| for (int i = n; i >= 1; --i) b[i] -= b[i - (i & -i)];
^5 ^5
------------------
| Branch (36:19): [True: 83.33%, False: 16.67%]
------------------
37| 6| while (q--) {
------------------
| Branch (37:10): [True: 83.33%, False: 16.67%]
------------------
38| 5| let t = rd.u1();
39| 5| if (t == 0) {
------------------
| Branch (39:9): [True: 20.00%, False: 80.00%]
------------------
40| 1| int k = l[rd.uh()];
41| 1| int x = rd.uw();
42| 3| for (; k <= n; k += k & -k) b[k] += x;
^2 ^2
------------------
| Branch (42:14): [True: 66.67%, False: 33.33%]
------------------
43| 1| }
44| 5| if (t == 1) {
------------------
| Branch (44:9): [True: 80.00%, False: 20.00%]
------------------
45| 4| int x = rd.uh();
46| 4| int L = l[x] - 1;
47| 4| int R = p[x];
48| 4| u64 sum = 0;
49| 7| for (; L > 0; L -= L & -L) sum -= b[L];
^3 ^3
------------------
| Branch (49:14): [True: 42.86%, False: 57.14%]
------------------
50| 12| for (; R > 0; R -= R & -R) sum += b[R];
^8 ^8
------------------
| Branch (50:14): [True: 66.67%, False: 33.33%]
------------------
51| 4| wt.ud(sum);
52| 4| }
53| 5| }
54| 1| return 0;
55| 1|}