/tmp/solutions/build/range_affine_range_sum-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 affine {
11| | u32 a, b;
12| 492| auto operator+(affine t) -> affine {
13| 492| return {u32(u64(t.a) * a % P), u32((u64(t.a) * b + t.b) % P)};
14| 492| }
15| 492| auto operator+=(affine t) -> void { *this = *this + t; }
16| |};
17| |
18| |struct node {
19| | u32 siz;
20| | u32 sum;
21| | affine aff;
22| 492| auto operator+=(affine t) -> void {
23| 492| aff += t;
24| 492| sum = (u64(t.a) * sum + u64(t.b) * siz) % P;
25| 492| }
26| |} a[N];
27| |
28| 984|void pushdown(int k) {
29| 984| for (int i = log(k) - 1; i >= 0; --i) {
^0
------------------
| Branch (29:28): [True: 0.00%, False: 100.00%]
------------------
30| 0| affine t = a[k >> i >> 1].aff;
31| 0| a[k >> i >> 1].aff = affine{1, 0};
32| 0| a[k >> i ^ 0] += t;
33| 0| a[k >> i ^ 1] += t;
34| 0| }
35| 984|}
36| |
37| 509|u32 mod(u32 x) { return x < P ? x : x - P; }
^0
------------------
| Branch (37:25): [True: 100.00%, False: 0.00%]
------------------
38| |
39| 984|void pushup(int k) {
40| 984| for (k /= 2; k > 0; k /= 2) {
^0
------------------
| Branch (40:16): [True: 0.00%, False: 100.00%]
------------------
41| 0| a[k].sum = mod(a[k * 2].sum + a[k * 2 + 1].sum);
42| 0| }
43| 984|}
44| |
45| |}; // namespace
46| |
47| 1|int main() {
48| 1| rd rd;
49| 1| wt wt;
50| 1| int n = rd.uh();
51| 1| int q = rd.uh();
52| 2| for (int i = 0; i < n; ++i) a[n + i].siz = 1, a[n + i].sum = rd.uw();
^1 ^1
------------------
| Branch (52:19): [True: 50.00%, False: 50.00%]
------------------
53| 2| for (int i = n - 1; i >= 0; --i) {
^1
------------------
| Branch (53:23): [True: 50.00%, False: 50.00%]
------------------
54| 1| a[i].aff = {1, 0};
55| 1| a[i].siz = a[2 * i].siz + a[2 * i + 1].siz;
56| 1| a[i].sum = mod(a[2 * i].sum + a[2 * i + 1].sum);
57| 1| }
58| 1.00k| while (q--) {
------------------
| Branch (58:10): [True: 99.90%, False: 0.10%]
------------------
59| 1.00k| let t = rd.u1();
60| 1.00k| if (t == 0) {
------------------
| Branch (60:9): [True: 49.20%, False: 50.80%]
------------------
61| 492| int l = n + rd.uh();
62| 492| int r = n + rd.uh() - 1;
63| 492| pushdown(l--);
64| 492| pushdown(r++);
65| 492| int k = log(l ^ r);
66| 492| affine x = {rd.uw(), rd.uw()};
67| 492| int t, i;
68| 984| for (t = ~l & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
^492
------------------
| Branch (68:41): [True: 50.00%, False: 50.00%]
------------------
69| 492| i = log(t);
70| 492| a[l >> i ^ 1] += x;
71| 492| }
72| 492| pushup(l >> i);
73| 492| for (t = +r & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
^0
------------------
| Branch (73:41): [True: 0.00%, False: 100.00%]
------------------
74| 0| i = log(t);
75| 0| a[r >> i ^ 1] += x;
76| 0| }
77| 492| pushup(r >> i);
78| 492| }
79| 1.00k| if (t == 1) {
------------------
| Branch (79:9): [True: 50.80%, False: 49.20%]
------------------
80| 508| int l = n + rd.uh();
81| 508| int r = n + rd.uh() - 1;
82| 508| u64 sizL = 0, sumL = 0;
83| 508| u64 sizR = 0, sumR = 0;
84| 1.01k| for (--l, ++r; l ^ r ^ 1;) {
------------------
| Branch (84:22): [True: 50.00%, False: 50.00%]
------------------
85| 508| if (~l & 1) sizL += a[l ^ 1].siz, sumL += a[l ^ 1].sum;
------------------
| Branch (85:13): [True: 100.00%, False: 0.00%]
------------------
86| 508| if (+r & 1) sizR += a[r ^ 1].siz, sumR += a[r ^ 1].sum;
^0
------------------
| Branch (86:13): [True: 0.00%, False: 100.00%]
------------------
87| 508| l /= 2, r /= 2;
88| 508| sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
89| 508| sumR = (a[r].aff.a * sumR + a[r].aff.b * sizR) % P;
90| 508| }
91| 508| sumL = mod(u32(sumL + sumR));
92| 508| sizL += sizR;
93| 508| for (l /= 2; l > 0; l /= 2) {
^0
------------------
| Branch (93:20): [True: 0.00%, False: 100.00%]
------------------
94| 0| sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
95| 0| }
96| 508| wt.uw(u32(sumL));
97| 508| }
98| 1.00k| }
99| 1| return 0;
100| 1|}