/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| 23.0k| auto operator+(affine t) -> affine {
13| 23.0k| return {u32(u64(t.a) * a % P), u32((u64(t.a) * b + t.b) % P)};
14| 23.0k| }
15| 23.0k| auto operator+=(affine t) -> void { *this = *this + t; }
16| |};
17| |
18| |struct node {
19| | u32 siz;
20| | u32 sum;
21| | affine aff;
22| 23.0k| auto operator+=(affine t) -> void {
23| 23.0k| aff += t;
24| 23.0k| sum = (u64(t.a) * sum + u64(t.b) * siz) % P;
25| 23.0k| }
26| |} a[N];
27| |
28| 1.26k|void pushdown(int k) {
29| 11.0k| for (int i = log(k) - 1; i >= 0; --i) {
^9.78k
------------------
| Branch (29:28): [True: 88.52%, False: 11.48%]
------------------
30| 9.78k| affine t = a[k >> i >> 1].aff;
31| 9.78k| a[k >> i >> 1].aff = affine{1, 0};
32| 9.78k| a[k >> i ^ 0] += t;
33| 9.78k| a[k >> i ^ 1] += t;
34| 9.78k| }
35| 1.26k|}
36| |
37| 9.19k|u32 mod(u32 x) { return x < P ? x : x - P; }
^4.62k^4.57k
------------------
| Branch (37:25): [True: 50.28%, False: 49.72%]
------------------
38| |
39| 1.26k|void pushup(int k) {
40| 9.64k| for (k /= 2; k > 0; k /= 2) {
^8.37k
------------------
| Branch (40:16): [True: 86.85%, False: 13.15%]
------------------
41| 8.37k| a[k].sum = mod(a[k * 2].sum + a[k * 2 + 1].sum);
42| 8.37k| }
43| 1.26k|}
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| 199| for (int i = 0; i < n; ++i) a[n + i].siz = 1, a[n + i].sum = rd.uw();
^198 ^198
------------------
| Branch (52:19): [True: 99.50%, False: 0.50%]
------------------
53| 199| for (int i = n - 1; i >= 0; --i) {
^198
------------------
| Branch (53:23): [True: 99.50%, False: 0.50%]
------------------
54| 198| a[i].aff = {1, 0};
55| 198| a[i].siz = a[2 * i].siz + a[2 * i + 1].siz;
56| 198| a[i].sum = mod(a[2 * i].sum + a[2 * i + 1].sum);
57| 198| }
58| 1.26k| while (q--) {
------------------
| Branch (58:10): [True: 99.92%, False: 0.08%]
------------------
59| 1.25k| let t = rd.u1();
60| 1.25k| if (t == 0) {
------------------
| Branch (60:9): [True: 50.36%, False: 49.64%]
------------------
61| 634| int l = n + rd.uh();
62| 634| int r = n + rd.uh() - 1;
63| 634| pushdown(l--);
64| 634| pushdown(r++);
65| 634| int k = log(l ^ r);
66| 634| affine x = {rd.uw(), rd.uw()};
67| 634| int t, i;
68| 2.34k| for (t = ~l & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
^1.70k
------------------
| Branch (68:41): [True: 72.91%, False: 27.09%]
------------------
69| 1.70k| i = log(t);
70| 1.70k| a[l >> i ^ 1] += x;
71| 1.70k| }
72| 634| pushup(l >> i);
73| 2.44k| for (t = +r & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
^1.81k
------------------
| Branch (73:41): [True: 74.11%, False: 25.89%]
------------------
74| 1.81k| i = log(t);
75| 1.81k| a[r >> i ^ 1] += x;
76| 1.81k| }
77| 634| pushup(r >> i);
78| 634| }
79| 1.25k| if (t == 1) {
------------------
| Branch (79:9): [True: 49.64%, False: 50.36%]
------------------
80| 625| int l = n + rd.uh();
81| 625| int r = n + rd.uh() - 1;
82| 625| u64 sizL = 0, sumL = 0;
83| 625| u64 sizR = 0, sumR = 0;
84| 4.71k| for (--l, ++r; l ^ r ^ 1;) {
------------------
| Branch (84:22): [True: 86.73%, False: 13.27%]
------------------
85| 4.08k| if (~l & 1) sizL += a[l ^ 1].siz, sumL += a[l ^ 1].sum;
^1.72k
------------------
| Branch (85:13): [True: 42.14%, False: 57.86%]
------------------
86| 4.08k| if (+r & 1) sizR += a[r ^ 1].siz, sumR += a[r ^ 1].sum;
^1.79k
------------------
| Branch (86:13): [True: 43.83%, False: 56.17%]
------------------
87| 4.08k| l /= 2, r /= 2;
88| 4.08k| sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
89| 4.08k| sumR = (a[r].aff.a * sumR + a[r].aff.b * sizR) % P;
90| 4.08k| }
91| 625| sumL = mod(u32(sumL + sumR));
92| 625| sizL += sizR;
93| 1.48k| for (l /= 2; l > 0; l /= 2) {
^863
------------------
| Branch (93:20): [True: 58.00%, False: 42.00%]
------------------
94| 863| sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
95| 863| }
96| 625| wt.uw(u32(sumL));
97| 625| }
98| 1.25k| }
99| 1| return 0;
100| 1|}