/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| 3.52k|def maintain(int x) -> void {
20| 3.52k| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
21| 3.52k| node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
22| 3.52k|}
23| |
24| 401|def build(int l, int r) -> int {
25| 401| if (l > r) return 0;
^201
------------------
| Branch (25:7): [True: 50.12%, False: 49.88%]
------------------
26| 200| int m = (l + r) / 2;
27| 200| node[m].l = build(l, m - 1);
28| 200| node[m].r = build(m + 1, r);
29| 200| maintain(m);
30| 200| return m;
31| 401|}
32| |
33| 62|def reverse(int x) -> void { node[x].rev ^= 1; }
34| |
35| 2.18k|def affine(int x, u64 a, u64 b) -> void {
36| 2.18k| if (x == 0) return;
^558
------------------
| Branch (36:7): [True: 25.50%, False: 74.50%]
------------------
37| 1.63k| node[x].a = (a * node[x].a) % P;
38| 1.63k| node[x].b = (a * node[x].b + b) % P;
39| 1.63k| node[x].val = (a * node[x].val + b) % P;
40| 1.63k| node[x].sum = (a * node[x].sum + b * node[x].size) % P;
41| 1.63k|}
42| |
43| 3.79k|def pushdown(int x) -> void {
44| 3.79k| if (node[x].rev) {
------------------
| Branch (44:7): [True: 21.38%, False: 78.62%]
------------------
45| 811| std::swap(node[x].l, node[x].r);
46| 811| node[node[x].l].rev ^= 1;
47| 811| node[node[x].r].rev ^= 1;
48| 811| node[x].rev = 0;
49| 811| }
50| 3.79k| if ((node[x].a != 1) | (node[x].b != 0)) {
------------------
| Branch (50:7): [True: 28.26%, False: 71.74%]
------------------
51| 1.07k| affine(node[x].l, node[x].a, node[x].b);
52| 1.07k| affine(node[x].r, node[x].a, node[x].b);
53| 1.07k| node[x].a = 1;
54| 1.07k| node[x].b = 0;
55| 1.07k| }
56| 3.79k|}
57| |
58| 1.71k|def zig(int &x) -> void {
59| 1.71k| int l = node[x].l;
60| 1.71k| node[x].l = node[l].r;
61| 1.71k| maintain(x);
62| 1.71k| node[l].r = x;
63| 1.71k| x = l;
64| 1.71k|}
65| |
66| 1.60k|def zag(int &x) -> void {
67| 1.60k| int r = node[x].r;
68| 1.60k| node[x].r = node[r].l;
69| 1.60k| maintain(x);
70| 1.60k| node[r].l = x;
71| 1.60k| x = r;
72| 1.60k|}
73| |
74| 2.01k|def splay(int &x, int k) -> void {
75| 2.01k| pushdown(x);
76| 2.01k| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (76:64): [True: 11.43%, False: 88.57%]
------------------
77| 230| return;
78| 1.78k| } else if (k < size) {
------------------
| Branch (78:14): [True: 51.52%, False: 48.48%]
------------------
79| 918| pushdown(l);
80| 918| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (80:69): [True: 14.92%, False: 85.08%]
------------------
81| 137| zig(x);
82| 781| } else if (k < size) {
------------------
| Branch (82:16): [True: 57.49%, False: 42.51%]
------------------
83| 449| splay(ll, k);
84| 449| zig(x);
85| 449| zig(x);
86| 449| } else {
87| 332| splay(lr, k - size - 1);
88| 332| zag(l);
89| 332| zig(x);
90| 332| }
91| 918| } else {
92| 864| pushdown(r);
93| 864| k -= size + 1;
94| 864| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (94:69): [True: 11.92%, False: 88.08%]
------------------
95| 103| zag(x);
96| 761| } else if (k < size) {
------------------
| Branch (96:16): [True: 45.99%, False: 54.01%]
------------------
97| 350| splay(rl, k);
98| 350| zig(r);
99| 350| zag(x);
100| 411| } else {
101| 411| splay(rr, k - size - 1);
102| 411| zag(x);
103| 411| zag(x);
104| 411| }
105| 864| }
106| 2.01k|}
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| 435| for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
^434 ^434
------------------
| Branch (115:19): [True: 99.77%, False: 0.23%]
------------------
116| 199| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^198 ^198
------------------
| Branch (116:19): [True: 99.50%, False: 0.50%]
------------------
117| 1| int x = build(1, n += 2);
118| 236| while (q--) {
------------------
| Branch (118:10): [True: 99.58%, False: 0.42%]
------------------
119| 235| let t = rd.u1();
120| 235| if (t == 0) {
------------------
| Branch (120:9): [True: 19.57%, False: 80.43%]
------------------
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| 235| if (t == 1) {
------------------
| Branch (128:9): [True: 17.87%, False: 82.13%]
------------------
129| 42| int k = rd.uh();
130| 42| splay(x, k);
131| 42| splay(node[x].r, 1);
132| 42| node[node[x].r].l = 0;
133| 42| }
134| 235| if (t == 2) {
------------------
| Branch (134:9): [True: 26.38%, False: 73.62%]
------------------
135| 62| int l = rd.uh();
136| 62| int r = rd.uh();
137| 62| splay(x, l);
138| 62| splay(node[x].r, r - l);
139| 62| reverse(node[node[x].r].l);
140| 62| }
141| 235| if (t == 3) {
------------------
| Branch (141:9): [True: 18.72%, False: 81.28%]
------------------
142| 44| int l = rd.uh();
143| 44| int r = rd.uh();
144| 44| splay(x, l);
145| 44| splay(node[x].r, r - l);
146| 44| int a = rd.uw();
147| 44| int b = rd.uw();
148| 44| affine(node[node[x].r].l, a, b);
149| 44| }
150| 235| if (t == 4) {
------------------
| Branch (150:9): [True: 17.45%, False: 82.55%]
------------------
151| 41| int l = rd.uh();
152| 41| int r = rd.uh();
153| 41| splay(x, l);
154| 41| splay(node[x].r, r - l);
155| 41| wt.ud(node[node[node[x].r].l].sum);
156| 41| }
157| 235| }
158| 1| return 0;
159| 1|}