/tmp/solutions/build/point_set_range_composite-main.cpp:
1| |#include <common.h>
2| |#include <toy/bit.h>
3| |prelude;
4| |
5| |namespace {
6| |
7| |constexpr int N = 1e6;
8| |constexpr int P = 998244353;
9| |
10| |struct node {
11| | u32 a, b;
12| 4.04M| auto operator+(node t) -> node {
13| 4.04M| return {u32(u64(t.a) * a % P), u32((u64(t.a) * b + t.b) % P)};
14| 4.04M| }
15| 3.66M| auto operator+(u32 x) -> u32 { return (u64(a) * x + b) % P; }
16| |} a[N];
17| |
18| |} // namespace
19| |
20| 1|int main() {
21| 1| rd rd;
22| 1| wt wt;
23| 1| int n = rd.uh();
24| 1| int q = rd.uh();
25| 463k| for (int i = 0; i < n; ++i) {
^463k
------------------
| Branch (25:19): [True: 100.00%, False: 0.00%]
------------------
26| 463k| int k = i * 2 + 1;
27| 463k| a[k] = {rd.uw(), rd.uw()};
28| 926k| for (int j = 1; k & (j * 2); k -= j, j *= 2) {
^463k
------------------
| Branch (28:21): [True: 50.00%, False: 50.00%]
------------------
29| 463k| a[k - j] = a[k - j * 2] + a[k];
30| 463k| }
31| 463k| }
32| 412k| while (q--) {
------------------
| Branch (32:10): [True: 100.00%, False: 0.00%]
------------------
33| 412k| let t = rd.u1();
34| 412k| if (t == 0) {
------------------
| Branch (34:9): [True: 49.95%, False: 50.05%]
------------------
35| 206k| int k = rd.uh() * 2 + 1;
36| 206k| a[k] = {rd.uw(), rd.uw()};
37| 3.78M| for (int j = 1;; j *= 2) {
^3.58M
38| 3.78M| if (k & (j * 2)) {
------------------
| Branch (38:13): [True: 47.24%, False: 52.76%]
------------------
39| 1.79M| a[k - j] = a[k - j * 2] + a[k];
40| 1.79M| k -= j;
41| 1.99M| } else {
42| 1.99M| if (k + j * 3 > n * 2) break;
^206k
------------------
| Branch (42:15): [True: 10.31%, False: 89.69%]
------------------
43| 1.79M| a[k + j] = a[k] + a[k + j * 2];
44| 1.79M| k += j;
45| 1.79M| }
46| 3.78M| }
47| 206k| }
48| 412k| if (t == 1) {
------------------
| Branch (48:9): [True: 50.05%, False: 49.95%]
------------------
49| 206k| int l = rd.uh() * 2 + 1;
50| 206k| int r = rd.uh() * 2 + 1;
51| 206k| u32 x = a[l] + rd.uw();
52| 206k| int k = (-1 << log(l ^ r)) & r;
53| 1.95M| for (++l; l < k; l += l & -l) {
^1.74M
------------------
| Branch (53:17): [True: 89.44%, False: 10.56%]
------------------
54| 1.74M| x = a[l + (l & -l) / 2] + x;
55| 1.74M| }
56| 1.91M| for (--r; k < r;) {
------------------
| Branch (56:17): [True: 89.19%, False: 10.81%]
------------------
57| 1.70M| int t = 1 << log(r - k);
58| 1.70M| x = a[k + t / 2] + x;
59| 1.70M| k += t;
60| 1.70M| }
61| 206k| wt.uw(x);
62| 206k| }
63| 412k| }
64| 1| return 0;
65| 1|}