/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| 4.37k|def maintain(int x) -> void {
20| 4.37k| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
21| 4.37k| node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
22| 4.37k|}
23| |
24| 1.21k|def build(int l, int r) -> int {
25| 1.21k| if (l > r) return 0;
^606
------------------
| Branch (25:7): [True: 50.04%, False: 49.96%]
------------------
26| 605| int m = (l + r) / 2;
27| 605| node[m].l = build(l, m - 1);
28| 605| node[m].r = build(m + 1, r);
29| 605| maintain(m);
30| 605| return m;
31| 1.21k|}
32| |
33| 50|def reverse(int x) -> void { node[x].rev ^= 1; }
34| |
35| 2.93k|def affine(int x, u64 a, u64 b) -> void {
36| 2.93k| if (x == 0) return;
^561
------------------
| Branch (36:7): [True: 19.09%, False: 80.91%]
------------------
37| 2.37k| node[x].a = (a * node[x].a) % P;
38| 2.37k| node[x].b = (a * node[x].b + b) % P;
39| 2.37k| node[x].val = (a * node[x].val + b) % P;
40| 2.37k| node[x].sum = (a * node[x].sum + b * node[x].size) % P;
41| 2.37k|}
42| |
43| 4.19k|def pushdown(int x) -> void {
44| 4.19k| if (node[x].rev) {
------------------
| Branch (44:7): [True: 22.88%, False: 77.12%]
------------------
45| 960| std::swap(node[x].l, node[x].r);
46| 960| node[node[x].l].rev ^= 1;
47| 960| node[node[x].r].rev ^= 1;
48| 960| node[x].rev = 0;
49| 960| }
50| 4.19k| if ((node[x].a != 1) | (node[x].b != 0)) {
------------------
| Branch (50:7): [True: 34.58%, False: 65.42%]
------------------
51| 1.45k| affine(node[x].l, node[x].a, node[x].b);
52| 1.45k| affine(node[x].r, node[x].a, node[x].b);
53| 1.45k| node[x].a = 1;
54| 1.45k| node[x].b = 0;
55| 1.45k| }
56| 4.19k|}
57| |
58| 1.94k|def zig(int &x) -> void {
59| 1.94k| int l = node[x].l;
60| 1.94k| node[x].l = node[l].r;
61| 1.94k| maintain(x);
62| 1.94k| node[l].r = x;
63| 1.94k| x = l;
64| 1.94k|}
65| |
66| 1.83k|def zag(int &x) -> void {
67| 1.83k| int r = node[x].r;
68| 1.83k| node[x].r = node[r].l;
69| 1.83k| maintain(x);
70| 1.83k| node[r].l = x;
71| 1.83k| x = r;
72| 1.83k|}
73| |
74| 2.20k|def splay(int &x, int k) -> void {
75| 2.20k| pushdown(x);
76| 2.20k| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (76:64): [True: 9.53%, False: 90.47%]
------------------
77| 210| return;
78| 1.99k| } else if (k < size) {
------------------
| Branch (78:14): [True: 52.38%, False: 47.62%]
------------------
79| 1.04k| pushdown(l);
80| 1.04k| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (80:69): [True: 11.11%, False: 88.89%]
------------------
81| 116| zig(x);
82| 928| } else if (k < size) {
------------------
| Branch (82:16): [True: 55.71%, False: 44.29%]
------------------
83| 517| splay(ll, k);
84| 517| zig(x);
85| 517| zig(x);
86| 517| } else {
87| 411| splay(lr, k - size - 1);
88| 411| zag(l);
89| 411| zig(x);
90| 411| }
91| 1.04k| } else {
92| 949| pushdown(r);
93| 949| k -= size + 1;
94| 949| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (94:69): [True: 10.12%, False: 89.88%]
------------------
95| 96| zag(x);
96| 853| } else if (k < size) {
------------------
| Branch (96:16): [True: 44.90%, False: 55.10%]
------------------
97| 383| splay(rl, k);
98| 383| zig(r);
99| 383| zag(x);
100| 470| } else {
101| 470| splay(rr, k - size - 1);
102| 470| zag(x);
103| 470| zag(x);
104| 470| }
105| 949| }
106| 2.20k|}
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| 816| for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
^815 ^815
------------------
| Branch (115:19): [True: 99.88%, False: 0.12%]
------------------
116| 604| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^603 ^603
------------------
| Branch (116:19): [True: 99.83%, False: 0.17%]
------------------
117| 1| int x = build(1, n += 2);
118| 212| while (q--) {
------------------
| Branch (118:10): [True: 99.53%, False: 0.47%]
------------------
119| 211| let t = rd.u1();
120| 211| if (t == 0) {
------------------
| Branch (120:9): [True: 21.80%, False: 78.20%]
------------------
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| 211| if (t == 1) {
------------------
| Branch (128:9): [True: 18.48%, False: 81.52%]
------------------
129| 39| int k = rd.uh();
130| 39| splay(x, k);
131| 39| splay(node[x].r, 1);
132| 39| node[node[x].r].l = 0;
133| 39| }
134| 211| if (t == 2) {
------------------
| Branch (134:9): [True: 23.70%, False: 76.30%]
------------------
135| 50| int l = rd.uh();
136| 50| int r = rd.uh();
137| 50| splay(x, l);
138| 50| splay(node[x].r, r - l);
139| 50| reverse(node[node[x].r].l);
140| 50| }
141| 211| if (t == 3) {
------------------
| Branch (141:9): [True: 17.06%, False: 82.94%]
------------------
142| 36| int l = rd.uh();
143| 36| int r = rd.uh();
144| 36| splay(x, l);
145| 36| splay(node[x].r, r - l);
146| 36| int a = rd.uw();
147| 36| int b = rd.uw();
148| 36| affine(node[node[x].r].l, a, b);
149| 36| }
150| 211| if (t == 4) {
------------------
| Branch (150:9): [True: 18.96%, False: 81.04%]
------------------
151| 40| int l = rd.uh();
152| 40| int r = rd.uh();
153| 40| splay(x, l);
154| 40| splay(node[x].r, r - l);
155| 40| wt.ud(node[node[node[x].r].l].sum);
156| 40| }
157| 211| }
158| 1| return 0;
159| 1|}