/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| 27|def maintain(int x) -> void {
20| 27| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
21| 27| node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
22| 27|}
23| |
24| 15|def build(int l, int r) -> int {
25| 15| if (l > r) return 0;
^8
------------------
| Branch (25:7): [True: 53.33%, False: 46.67%]
------------------
26| 7| int m = (l + r) / 2;
27| 7| node[m].l = build(l, m - 1);
28| 7| node[m].r = build(m + 1, r);
29| 7| maintain(m);
30| 7| return m;
31| 15|}
32| |
33| 1|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| 32|def pushdown(int x) -> void {
44| 32| if (node[x].rev) {
------------------
| Branch (44:7): [True: 6.25%, False: 93.75%]
------------------
45| 2| std::swap(node[x].l, node[x].r);
46| 2| node[node[x].l].rev ^= 1;
47| 2| node[node[x].r].rev ^= 1;
48| 2| node[x].rev = 0;
49| 2| }
50| 32| 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| 32|}
57| |
58| 10|def zig(int &x) -> void {
59| 10| int l = node[x].l;
60| 10| node[x].l = node[l].r;
61| 10| maintain(x);
62| 10| node[l].r = x;
63| 10| x = l;
64| 10|}
65| |
66| 10|def zag(int &x) -> void {
67| 10| int r = node[x].r;
68| 10| node[x].r = node[r].l;
69| 10| maintain(x);
70| 10| node[r].l = x;
71| 10| x = r;
72| 10|}
73| |
74| 19|def splay(int &x, int k) -> void {
75| 19| pushdown(x);
76| 19| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (76:64): [True: 31.58%, False: 68.42%]
------------------
77| 6| return;
78| 13| } else if (k < size) {
------------------
| Branch (78:14): [True: 46.15%, False: 53.85%]
------------------
79| 6| pushdown(l);
80| 6| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (80:69): [True: 66.67%, False: 33.33%]
------------------
81| 4| zig(x);
82| 4| } else if (k < size) {
^2 ^2
------------------
| Branch (82:16): [True: 50.00%, False: 50.00%]
------------------
83| 1| splay(ll, k);
84| 1| zig(x);
85| 1| zig(x);
86| 1| } else {
87| 1| splay(lr, k - size - 1);
88| 1| zag(l);
89| 1| zig(x);
90| 1| }
91| 7| } else {
92| 7| pushdown(r);
93| 7| k -= size + 1;
94| 7| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (94:69): [True: 28.57%, False: 71.43%]
------------------
95| 2| zag(x);
96| 5| } else if (k < size) {
------------------
| Branch (96:16): [True: 60.00%, False: 40.00%]
------------------
97| 3| splay(rl, k);
98| 3| zig(r);
99| 3| zag(x);
100| 3| } else {
101| 2| splay(rr, k - size - 1);
102| 2| zag(x);
103| 2| zag(x);
104| 2| }
105| 7| }
106| 19|}
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| 13| for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
^12 ^12
------------------
| Branch (115:19): [True: 92.31%, False: 7.69%]
------------------
116| 6| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^5 ^5
------------------
| Branch (116:19): [True: 83.33%, False: 16.67%]
------------------
117| 1| int x = build(1, n += 2);
118| 7| while (q--) {
------------------
| Branch (118:10): [True: 85.71%, False: 14.29%]
------------------
119| 6| let t = rd.u1();
120| 6| if (t == 0) {
------------------
| Branch (120:9): [True: 16.67%, False: 83.33%]
------------------
121| 1| ++n;
122| 1| int k = rd.uh();
123| 1| node[n].val = node[n].sum = rd.uw();
124| 1| splay(x, k);
125| 1| splay(node[x].r, 0);
126| 1| node[node[x].r].l = n;
127| 1| }
128| 6| if (t == 1) {
------------------
| Branch (128:9): [True: 16.67%, False: 83.33%]
------------------
129| 1| int k = rd.uh();
130| 1| splay(x, k);
131| 1| splay(node[x].r, 1);
132| 1| node[node[x].r].l = 0;
133| 1| }
134| 6| if (t == 2) {
------------------
| Branch (134:9): [True: 16.67%, False: 83.33%]
------------------
135| 1| int l = rd.uh();
136| 1| int r = rd.uh();
137| 1| splay(x, l);
138| 1| splay(node[x].r, r - l);
139| 1| reverse(node[node[x].r].l);
140| 1| }
141| 6| 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| 6| if (t == 4) {
------------------
| Branch (150:9): [True: 50.00%, False: 50.00%]
------------------
151| 3| int l = rd.uh();
152| 3| int r = rd.uh();
153| 3| splay(x, l);
154| 3| splay(node[x].r, r - l);
155| 3| wt.ud(node[node[node[x].r].l].sum);
156| 3| }
157| 6| }
158| 1| return 0;
159| 1|}