/tmp/solutions/build/range_affine_point_get-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| 5.30k| auto operator+(node t) -> node {
13| 5.30k| return {u32(u64(t.a) * a % P), u32((u64(t.a) * b + t.b) % P)};
14| 5.30k| }
15| 1.28k| auto operator+(u32 x) -> u32 { return (u64(a) * x + b) % P; }
16| 5.30k| auto operator+=(node t) -> void { *this = *this + t; }
17| |} a[N];
18| |
19| 946|void pushdown(int k) {
20| 3.21k| for (int i = log(k) - 1; i >= 0; --i) {
^2.27k
------------------
| Branch (20:28): [True: 70.59%, False: 29.41%]
------------------
21| 2.27k| node t = a[k >> i >> 1];
22| 2.27k| a[k >> i >> 1] = node{1, 0};
23| 2.27k| a[k >> i ^ 0] += t;
24| 2.27k| a[k >> i ^ 1] += t;
25| 2.27k| }
26| 946|}
27| |
28| |} // namespace
29| |
30| 1|int main() {
31| 1| rd rd;
32| 1| wt wt;
33| 1| int n = rd.uh();
34| 1| int q = rd.uh();
35| 6| for (int i = 0; i < n; ++i) a[i] = {1, 0}, a[n + i].b = rd.uw();
^5 ^5
------------------
| Branch (35:19): [True: 83.33%, False: 16.67%]
------------------
36| 1.00k| while (q--) {
------------------
| Branch (36:10): [True: 99.90%, False: 0.10%]
------------------
37| 1.00k| let t = rd.u1();
38| 1.00k| if (t == 0) {
------------------
| Branch (38:9): [True: 47.30%, False: 52.70%]
------------------
39| 473| int l = n + rd.uh();
40| 473| int r = n + rd.uh() - 1;
41| 473| node x = {rd.uw(), rd.uw()};
42| 473| pushdown(l--);
43| 473| pushdown(r++);
44| 473| int k = log(l ^ r);
45| 928| for (int t = ~l & ~(-1 << k), i; t > 0; t -= 1 << i) {
^455
------------------
| Branch (45:40): [True: 49.03%, False: 50.97%]
------------------
46| 455| i = log(t);
47| 455| a[l >> i ^ 1] += x;
48| 455| }
49| 779| for (int t = +r & ~(-1 << k), i; t > 0; t -= 1 << i) {
^306
------------------
| Branch (49:40): [True: 39.28%, False: 60.72%]
------------------
50| 306| i = log(t);
51| 306| a[r >> i ^ 1] += x;
52| 306| }
53| 473| }
54| 1.00k| if (t == 1) {
------------------
| Branch (54:9): [True: 52.70%, False: 47.30%]
------------------
55| 527| int k = n + rd.uh();
56| 527| u32 x = a[k].b;
57| 1.81k| for (k /= 2; k > 0; k /= 2) x = a[k] + x;
^1.28k ^1.28k
------------------
| Branch (57:20): [True: 70.93%, False: 29.07%]
------------------
58| 527| wt.uw(x);
59| 527| }
60| 1.00k| }
61| 1| return 0;
62| 1|}