/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| 33| auto operator+(affine t) -> affine {
13| 33| return {u32(u64(t.a) * a % P), u32((u64(t.a) * b + t.b) % P)};
14| 33| }
15| 33| auto operator+=(affine t) -> void { *this = *this + t; }
16| |};
17| |
18| |struct node {
19| | u32 siz;
20| | u32 sum;
21| | affine aff;
22| 33| auto operator+=(affine t) -> void {
23| 33| aff += t;
24| 33| sum = (u64(t.a) * sum + u64(t.b) * siz) % P;
25| 33| }
26| |} a[N];
27| |
28| 6|void pushdown(int k) {
29| 20| for (int i = log(k) - 1; i >= 0; --i) {
^14
------------------
| Branch (29:28): [True: 70.00%, False: 30.00%]
------------------
30| 14| affine t = a[k >> i >> 1].aff;
31| 14| a[k >> i >> 1].aff = affine{1, 0};
32| 14| a[k >> i ^ 0] += t;
33| 14| a[k >> i ^ 1] += t;
34| 14| }
35| 6|}
36| |
37| 19|u32 mod(u32 x) { return x < P ? x : x - P; }
^0
------------------
| Branch (37:25): [True: 100.00%, False: 0.00%]
------------------
38| |
39| 6|void pushup(int k) {
40| 16| for (k /= 2; k > 0; k /= 2) {
^10
------------------
| Branch (40:16): [True: 62.50%, False: 37.50%]
------------------
41| 10| a[k].sum = mod(a[k * 2].sum + a[k * 2 + 1].sum);
42| 10| }
43| 6|}
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| 6| for (int i = 0; i < n; ++i) a[n + i].siz = 1, a[n + i].sum = rd.uw();
^5 ^5
------------------
| Branch (52:19): [True: 83.33%, False: 16.67%]
------------------
53| 6| for (int i = n - 1; i >= 0; --i) {
^5
------------------
| Branch (53:23): [True: 83.33%, False: 16.67%]
------------------
54| 5| a[i].aff = {1, 0};
55| 5| a[i].siz = a[2 * i].siz + a[2 * i + 1].siz;
56| 5| a[i].sum = mod(a[2 * i].sum + a[2 * i + 1].sum);
57| 5| }
58| 8| while (q--) {
------------------
| Branch (58:10): [True: 87.50%, False: 12.50%]
------------------
59| 7| let t = rd.u1();
60| 7| if (t == 0) {
------------------
| Branch (60:9): [True: 42.86%, False: 57.14%]
------------------
61| 3| int l = n + rd.uh();
62| 3| int r = n + rd.uh() - 1;
63| 3| pushdown(l--);
64| 3| pushdown(r++);
65| 3| int k = log(l ^ r);
66| 3| affine x = {rd.uw(), rd.uw()};
67| 3| int t, i;
68| 6| for (t = ~l & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
^3
------------------
| Branch (68:41): [True: 50.00%, False: 50.00%]
------------------
69| 3| i = log(t);
70| 3| a[l >> i ^ 1] += x;
71| 3| }
72| 3| pushup(l >> i);
73| 5| for (t = +r & ~(-1 << k), i = 31; t > 0; t -= 1 << i) {
^2
------------------
| Branch (73:41): [True: 40.00%, False: 60.00%]
------------------
74| 2| i = log(t);
75| 2| a[r >> i ^ 1] += x;
76| 2| }
77| 3| pushup(r >> i);
78| 3| }
79| 7| if (t == 1) {
------------------
| Branch (79:9): [True: 57.14%, False: 42.86%]
------------------
80| 4| int l = n + rd.uh();
81| 4| int r = n + rd.uh() - 1;
82| 4| u64 sizL = 0, sumL = 0;
83| 4| u64 sizR = 0, sumR = 0;
84| 16| for (--l, ++r; l ^ r ^ 1;) {
------------------
| Branch (84:22): [True: 75.00%, False: 25.00%]
------------------
85| 12| if (~l & 1) sizL += a[l ^ 1].siz, sumL += a[l ^ 1].sum;
^7
------------------
| Branch (85:13): [True: 58.33%, False: 41.67%]
------------------
86| 12| if (+r & 1) sizR += a[r ^ 1].siz, sumR += a[r ^ 1].sum;
^3
------------------
| Branch (86:13): [True: 25.00%, False: 75.00%]
------------------
87| 12| l /= 2, r /= 2;
88| 12| sumL = (a[l].aff.a * sumL + a[l].aff.b * sizL) % P;
89| 12| sumR = (a[r].aff.a * sumR + a[r].aff.b * sizR) % P;
90| 12| }
91| 4| sumL = mod(u32(sumL + sumR));
92| 4| sizL += sizR;
93| 4| 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| 4| wt.uw(u32(sumL));
97| 4| }
98| 7| }
99| 1| return 0;
100| 1|}