/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| 20.7M|def maintain(int x) -> void {
20| 20.7M| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
21| 20.7M| node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
22| 20.7M|}
23| |
24| 1.00M|def build(int l, int r) -> int {
25| 1.00M| if (l > r) return 0;
^500k
------------------
| Branch (25:7): [True: 50.00%, False: 50.00%]
------------------
26| 500k| int m = (l + r) / 2;
27| 500k| node[m].l = build(l, m - 1);
28| 500k| node[m].r = build(m + 1, r);
29| 500k| maintain(m);
30| 500k| return m;
31| 1.00M|}
32| |
33| 0|def reverse(int x) -> void { node[x].rev ^= 1; }
34| |
35| 0|def affine(int x, u64 a, u64 b) -> void {
36| 0| if (x == 0) return;
------------------
| Branch (36:7): [True: 0.00%, False: 0.00%]
------------------
37| 0| node[x].a = (a * node[x].a) % P;
38| 0| node[x].b = (a * node[x].b + b) % P;
39| 0| node[x].val = (a * node[x].val + b) % P;
40| 0| node[x].sum = (a * node[x].sum + b * node[x].size) % P;
41| 0|}
42| |
43| 21.2M|def pushdown(int x) -> void {
44| 21.2M| if (node[x].rev) {
------------------
| Branch (44:7): [True: 0.00%, False: 100.00%]
------------------
45| 0| std::swap(node[x].l, node[x].r);
46| 0| node[node[x].l].rev ^= 1;
47| 0| node[node[x].r].rev ^= 1;
48| 0| node[x].rev = 0;
49| 0| }
50| 21.2M| if ((node[x].a != 1) | (node[x].b != 0)) {
------------------
| Branch (50:7): [True: 0.00%, False: 100.00%]
------------------
51| 0| affine(node[x].l, node[x].a, node[x].b);
52| 0| affine(node[x].r, node[x].a, node[x].b);
53| 0| node[x].a = 1;
54| 0| node[x].b = 0;
55| 0| }
56| 21.2M|}
57| |
58| 10.9M|def zig(int &x) -> void {
59| 10.9M| int l = node[x].l;
60| 10.9M| node[x].l = node[l].r;
61| 10.9M| maintain(x);
62| 10.9M| node[l].r = x;
63| 10.9M| x = l;
64| 10.9M|}
65| |
66| 9.24M|def zag(int &x) -> void {
67| 9.24M| int r = node[x].r;
68| 9.24M| node[x].r = node[r].l;
69| 9.24M| maintain(x);
70| 9.24M| node[r].l = x;
71| 9.24M| x = r;
72| 9.24M|}
73| |
74| 10.8M|def splay(int &x, int k) -> void {
75| 10.8M| pushdown(x);
76| 10.8M| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (76:64): [True: 4.61%, False: 95.39%]
------------------
77| 499k| return;
78| 10.3M| } else if (k < size) {
------------------
| Branch (78:14): [True: 55.81%, False: 44.19%]
------------------
79| 5.77M| pushdown(l);
80| 5.77M| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (80:69): [True: 5.13%, False: 94.87%]
------------------
81| 296k| zig(x);
82| 5.48M| } else if (k < size) {
------------------
| Branch (82:16): [True: 65.01%, False: 34.99%]
------------------
83| 3.56M| splay(ll, k);
84| 3.56M| zig(x);
85| 3.56M| zig(x);
86| 3.56M| } else {
87| 1.91M| splay(lr, k - size - 1);
88| 1.91M| zag(l);
89| 1.91M| zig(x);
90| 1.91M| }
91| 5.77M| } else {
92| 4.57M| pushdown(r);
93| 4.57M| k -= size + 1;
94| 4.57M| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (94:69): [True: 4.45%, False: 95.55%]
------------------
95| 203k| zag(x);
96| 4.37M| } else if (k < size) {
------------------
| Branch (96:16): [True: 37.16%, False: 62.84%]
------------------
97| 1.62M| splay(rl, k);
98| 1.62M| zig(r);
99| 1.62M| zag(x);
100| 2.74M| } else {
101| 2.74M| splay(rr, k - size - 1);
102| 2.74M| zag(x);
103| 2.74M| zag(x);
104| 2.74M| }
105| 4.57M| }
106| 10.8M|}
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.00M| for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
^1.00M^1.00M
------------------
| Branch (115:19): [True: 100.00%, False: 0.00%]
------------------
116| 500k| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^500k^500k
------------------
| Branch (116:19): [True: 100.00%, False: 0.00%]
------------------
117| 1| int x = build(1, n += 2);
118| 500k| while (q--) {
------------------
| Branch (118:10): [True: 100.00%, False: 0.00%]
------------------
119| 500k| let t = rd.u1();
120| 500k| if (t == 0) {
------------------
| Branch (120:9): [True: 0.00%, False: 100.00%]
------------------
121| 0| ++n;
122| 0| int k = rd.uh();
123| 0| node[n].val = node[n].sum = rd.uw();
124| 0| splay(x, k);
125| 0| splay(node[x].r, 0);
126| 0| node[node[x].r].l = n;
127| 0| }
128| 500k| if (t == 1) {
------------------
| Branch (128:9): [True: 100.00%, False: 0.00%]
------------------
129| 500k| int k = rd.uh();
130| 500k| splay(x, k);
131| 500k| splay(node[x].r, 1);
132| 500k| node[node[x].r].l = 0;
133| 500k| }
134| 500k| if (t == 2) {
------------------
| Branch (134:9): [True: 0.00%, False: 100.00%]
------------------
135| 0| int l = rd.uh();
136| 0| int r = rd.uh();
137| 0| splay(x, l);
138| 0| splay(node[x].r, r - l);
139| 0| reverse(node[node[x].r].l);
140| 0| }
141| 500k| if (t == 3) {
------------------
| Branch (141:9): [True: 0.00%, False: 100.00%]
------------------
142| 0| int l = rd.uh();
143| 0| int r = rd.uh();
144| 0| splay(x, l);
145| 0| splay(node[x].r, r - l);
146| 0| int a = rd.uw();
147| 0| int b = rd.uw();
148| 0| affine(node[node[x].r].l, a, b);
149| 0| }
150| 500k| if (t == 4) {
------------------
| Branch (150:9): [True: 0.00%, False: 100.00%]
------------------
151| 0| int l = rd.uh();
152| 0| int r = rd.uh();
153| 0| splay(x, l);
154| 0| splay(node[x].r, r - l);
155| 0| wt.ud(node[node[node[x].r].l].sum);
156| 0| }
157| 500k| }
158| 1| return 0;
159| 1|}