/tmp/solutions/build/point_add_range_sum-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |u64 a[500001];
5| |
6| 1|int main() {
7| 1| rd rd;
8| 1| wt wt;
9| 1| int n = rd.uh();
10| 1| int q = rd.uh();
11| 9| for (int i = 1; i <= n; ++i) a[i] = a[i - 1] + rd.uw();
^8 ^8
------------------
| Branch (11:19): [True: 88.89%, False: 11.11%]
------------------
12| 9| for (int i = n; i >= 1; --i) a[i] -= a[i - (i & -i)];
^8 ^8
------------------
| Branch (12:19): [True: 88.89%, False: 11.11%]
------------------
13| 1.00k| while (q--) {
------------------
| Branch (13:10): [True: 99.90%, False: 0.10%]
------------------
14| 1.00k| let t = rd.u1();
15| 1.00k| if (t == 0) {
------------------
| Branch (15:9): [True: 51.50%, False: 48.50%]
------------------
16| 515| int k = rd.uh() + 1;
17| 515| int x = rd.uw();
18| 1.79k| for (; k <= n; k += k & -k) a[k] += x;
^1.28k ^1.28k
------------------
| Branch (18:14): [True: 71.37%, False: 28.63%]
------------------
19| 515| }
20| 1.00k| if (t == 1) {
------------------
| Branch (20:9): [True: 48.50%, False: 51.50%]
------------------
21| 485| int l = rd.uh();
22| 485| int r = rd.uh();
23| 485| u64 ans = 0;
24| 1.02k| for (int k = l; k > 0; k -= k & -k) ans -= a[k];
^537 ^537
------------------
| Branch (24:23): [True: 52.54%, False: 47.46%]
------------------
25| 1.36k| for (int k = r; k > 0; k -= k & -k) ans += a[k];
^877 ^877
------------------
| Branch (25:23): [True: 64.39%, False: 35.61%]
------------------
26| 485| wt.ud(ans);
27| 485| }
28| 1.00k| }
29| 1| return 0;
30| 1|}