/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| 7.48k| auto operator+(affine t) -> affine {
13| 7.48k| return {u32(u64(t.a) * a % P), u32((u64(t.a) * b + t.b) % P)};
14| 7.48k| }
15| 7.48k| auto operator+=(affine t) -> void { *this = *this + t; }
16| |};
17| |
18| |struct node {
19| | u32 siz;
20| | u32 sum;
21| | affine aff;
22| 7.48k| auto operator+=(affine t) -> void {
23| 7.48k| aff += t;
24| 7.48k| sum = (u64(t.a) * sum + u64(t.b) * siz) % P;
25| 7.48k| }
26| |} a[N];
27| |
28| 1.01k|void pushdown(int k) {
29| 4.25k| for (int i = log(k) - 1; i >= 0; --i) {
^3.24k
------------------
| Branch (29:28): [True: 76.24%, False: 23.76%]
------------------
30| 3.24k| affine t = a[k >> i >> 1].aff;
31| 3.24k| a[k >> i >> 1].aff = affine{1, 0};
32| 3.24k| a[k >> i ^ 0] += t;
33| 3.24k| a[k >> i ^ 1] += t;
34| 3.24k| }
35| 1.01k|}
36| |
37| 2.72k|u32 mod(u32 x) { return x < P ? x : x - P; }
^1.41k^1.30k
------------------
| Branch (37:25): [True: 52.02%, False: 47.98%]
------------------
38| |
39| 1.01k|void pushup(int k) {
40| 3.22k| for (k /= 2; k > 0; k /= 2) {
^2.21k
------------------
| Branch (40:16): [True: 68.69%, False: 31.31%]
------------------
41| 2.21k| a[k].sum = mod(a[k * 2].sum + a[k * 2 + 1].sum);
42| 2.21k| }
43| 1.01k|}
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| 10| for (int i = 0; i < n; ++i) a[n + i].siz = 1, a[n + i].sum = rd.uw();
^9 ^9
------------------
| Branch (52:19): [True: 90.00%, False: 10.00%]
------------------
53| 10| for (int i = n - 1; i >= 0; --i) {
^9
------------------
| Branch (53:23): [True: 90.00%, False: 10.00%]
------------------
54| 9| a[i].aff = {1, 0};
55| 9| a[i].siz = a[2 * i].siz + a[2 * i + 1].siz;
56| 9| a[i].sum = mod(a[2 * i].sum + a[2 * i + 1].sum);
57| 9| }
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: 50.50%, False: 49.50%]
------------------
61| 505| int l = n + rd.uh();
62| 505| int r = n + rd.uh() - 1;
63| 505| pushdown(l--);
64| 505| pushdown(r++);
65| 505| int k = log(l ^ r);
66| 505| affine x = {rd.uw(), rd.uw()};
67| 505| int t, i;
68| 1.10k| for (t = ~l & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
^597
------------------
| Branch (68:41): [True: 54.17%, False: 45.83%]
------------------
69| 597| i = log(t);
70| 597| a[l >> i ^ 1] += x;
71| 597| }
72| 505| pushup(l >> i);
73| 914| for (t = +r & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
^409
------------------
| Branch (73:41): [True: 44.75%, False: 55.25%]
------------------
74| 409| i = log(t);
75| 409| a[r >> i ^ 1] += x;
76| 409| }
77| 505| pushup(r >> i);
78| 505| }
79| 1.00k| if (t == 1) {
------------------
| Branch (79:9): [True: 49.50%, False: 50.50%]
------------------
80| 495| int l = n + rd.uh();
81| 495| int r = n + rd.uh() - 1;
82| 495| u64 sizL = 0, sumL = 0;
83| 495| u64 sizR = 0, sumR = 0;
84| 1.91k| for (--l, ++r; l ^ r ^ 1;) {
------------------
| Branch (84:22): [True: 74.12%, False: 25.88%]
------------------
85| 1.41k| if (~l & 1) sizL += a[l ^ 1].siz, sumL += a[l ^ 1].sum;
^629
------------------
| Branch (85:13): [True: 44.36%, False: 55.64%]
------------------
86| 1.41k| if (+r & 1) sizR += a[r ^ 1].siz, sumR += a[r ^ 1].sum;
^383
------------------
| Branch (86:13): [True: 27.01%, False: 72.99%]
------------------
87| 1.41k| l /= 2, r /= 2;
88| 1.41k| sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
89| 1.41k| sumR = (a[r].aff.a * sumR + a[r].aff.b * sizR) % P;
90| 1.41k| }
91| 495| sumL = mod(u32(sumL + sumR));
92| 495| sizL += sizR;
93| 822| for (l /= 2; l > 0; l /= 2) {
^327
------------------
| Branch (93:20): [True: 39.78%, False: 60.22%]
------------------
94| 327| sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
95| 327| }
96| 495| wt.uw(u32(sumL));
97| 495| }
98| 1.00k| }
99| 1| return 0;
100| 1|}