/tmp/solutions/build/dynamic_sequence_range_affine_range_sum-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |constexpr int N = 1000003;
7| |constexpr u32 P = 998244353;
8| |
9| |struct Node {
10| | u32 val;
11| | u32 sum;
12| | u32 a;
13| | u32 b;
14| | int rev;
15| | int size;
16| | int l, r;
17| |} node[N];
18| |
19| 5.12k|def maintain(int x) -> void {
20| 5.12k| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
21| 5.12k| node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
22| 5.12k|}
23| |
24| 1.75k|def build(int l, int r) -> int {
25| 1.75k| if (l > r) return 0;
^877
------------------
| Branch (25:7): [True: 50.03%, False: 49.97%]
------------------
26| 876| int m = (l + r) / 2;
27| 876| node[m].l = build(l, m - 1);
28| 876| node[m].r = build(m + 1, r);
29| 876| maintain(m);
30| 876| return m;
31| 1.75k|}
32| |
33| 33|def reverse(int x) -> void { node[x].rev ^= 1; }
34| |
35| 3.89k|def affine(int x, u64 a, u64 b) -> void {
36| 3.89k| if (x == 0) return;
^632
------------------
| Branch (36:7): [True: 16.22%, False: 83.78%]
------------------
37| 3.26k| node[x].a = (a * node[x].a) % P;
38| 3.26k| node[x].b = (a * node[x].b + b) % P;
39| 3.26k| node[x].val = (a * node[x].val + b) % P;
40| 3.26k| node[x].sum = (a * node[x].sum + b * node[x].size) % P;
41| 3.26k|}
42| |
43| 4.69k|def pushdown(int x) -> void {
44| 4.69k| if (node[x].rev) {
------------------
| Branch (44:7): [True: 18.98%, False: 81.02%]
------------------
45| 891| std::swap(node[x].l, node[x].r);
46| 891| node[node[x].l].rev ^= 1;
47| 891| node[node[x].r].rev ^= 1;
48| 891| node[x].rev = 0;
49| 891| }
50| 4.69k| if ((node[x].a != 1) | (node[x].b != 0)) {
------------------
| Branch (50:7): [True: 40.98%, False: 59.02%]
------------------
51| 1.92k| affine(node[x].l, node[x].a, node[x].b);
52| 1.92k| affine(node[x].r, node[x].a, node[x].b);
53| 1.92k| node[x].a = 1;
54| 1.92k| node[x].b = 0;
55| 1.92k| }
56| 4.69k|}
57| |
58| 2.21k|def zig(int &x) -> void {
59| 2.21k| int l = node[x].l;
60| 2.21k| node[x].l = node[l].r;
61| 2.21k| maintain(x);
62| 2.21k| node[l].r = x;
63| 2.21k| x = l;
64| 2.21k|}
65| |
66| 2.03k|def zag(int &x) -> void {
67| 2.03k| int r = node[x].r;
68| 2.03k| node[x].r = node[r].l;
69| 2.03k| maintain(x);
70| 2.03k| node[r].l = x;
71| 2.03k| x = r;
72| 2.03k|}
73| |
74| 2.45k|def splay(int &x, int k) -> void {
75| 2.45k| pushdown(x);
76| 2.45k| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (76:64): [True: 8.76%, False: 91.24%]
------------------
77| 215| return;
78| 2.24k| } else if (k < size) {
------------------
| Branch (78:14): [True: 52.14%, False: 47.86%]
------------------
79| 1.16k| pushdown(l);
80| 1.16k| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (80:69): [True: 11.64%, False: 88.36%]
------------------
81| 136| zig(x);
82| 1.03k| } else if (k < size) {
------------------
| Branch (82:16): [True: 58.91%, False: 41.09%]
------------------
83| 608| splay(ll, k);
84| 608| zig(x);
85| 608| zig(x);
86| 608| } else {
87| 424| splay(lr, k - size - 1);
88| 424| zag(l);
89| 424| zig(x);
90| 424| }
91| 1.16k| } else {
92| 1.07k| pushdown(r);
93| 1.07k| k -= size + 1;
94| 1.07k| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (94:69): [True: 8.49%, False: 91.51%]
------------------
95| 91| zag(x);
96| 981| } else if (k < size) {
------------------
| Branch (96:16): [True: 45.06%, False: 54.94%]
------------------
97| 442| splay(rl, k);
98| 442| zig(r);
99| 442| zag(x);
100| 539| } else {
101| 539| splay(rr, k - size - 1);
102| 539| zag(x);
103| 539| zag(x);
104| 539| }
105| 1.07k| }
106| 2.45k|}
107| |
108| |} // namespace
109| |
110| 1|int main() {
111| 1| rd rd;
112| 1| wt wt;
113| 1| int n = rd.uh();
114| 1| int q = rd.uh();
115| 1.09k| for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
^1.09k^1.09k
------------------
| Branch (115:19): [True: 99.91%, False: 0.09%]
------------------
116| 875| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^874 ^874
------------------
| Branch (116:19): [True: 99.89%, False: 0.11%]
------------------
117| 1| int x = build(1, n += 2);
118| 222| while (q--) {
------------------
| Branch (118:10): [True: 99.55%, False: 0.45%]
------------------
119| 221| let t = rd.u1();
120| 221| if (t == 0) {
------------------
| Branch (120:9): [True: 20.81%, False: 79.19%]
------------------
121| 46| ++n;
122| 46| int k = rd.uh();
123| 46| node[n].val = node[n].sum = rd.uw();
124| 46| splay(x, k);
125| 46| splay(node[x].r, 0);
126| 46| node[node[x].r].l = n;
127| 46| }
128| 221| if (t == 1) {
------------------
| Branch (128:9): [True: 22.17%, False: 77.83%]
------------------
129| 49| int k = rd.uh();
130| 49| splay(x, k);
131| 49| splay(node[x].r, 1);
132| 49| node[node[x].r].l = 0;
133| 49| }
134| 221| if (t == 2) {
------------------
| Branch (134:9): [True: 14.93%, False: 85.07%]
------------------
135| 33| int l = rd.uh();
136| 33| int r = rd.uh();
137| 33| splay(x, l);
138| 33| splay(node[x].r, r - l);
139| 33| reverse(node[node[x].r].l);
140| 33| }
141| 221| if (t == 3) {
------------------
| Branch (141:9): [True: 22.17%, False: 77.83%]
------------------
142| 49| int l = rd.uh();
143| 49| int r = rd.uh();
144| 49| splay(x, l);
145| 49| splay(node[x].r, r - l);
146| 49| int a = rd.uw();
147| 49| int b = rd.uw();
148| 49| affine(node[node[x].r].l, a, b);
149| 49| }
150| 221| if (t == 4) {
------------------
| Branch (150:9): [True: 19.91%, False: 80.09%]
------------------
151| 44| int l = rd.uh();
152| 44| int r = rd.uh();
153| 44| splay(x, l);
154| 44| splay(node[x].r, r - l);
155| 44| wt.ud(node[node[node[x].r].l].sum);
156| 44| }
157| 221| }
158| 1| return 0;
159| 1|}