/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.34k|def maintain(int x) -> void {
20| 4.34k| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
21| 4.34k| node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
22| 4.34k|}
23| |
24| 181|def build(int l, int r) -> int {
25| 181| if (l > r) return 0;
^91
------------------
| Branch (25:7): [True: 50.28%, False: 49.72%]
------------------
26| 90| int m = (l + r) / 2;
27| 90| node[m].l = build(l, m - 1);
28| 90| node[m].r = build(m + 1, r);
29| 90| maintain(m);
30| 90| return m;
31| 181|}
32| |
33| 72|def reverse(int x) -> void { node[x].rev ^= 1; }
34| |
35| 2.28k|def affine(int x, u64 a, u64 b) -> void {
36| 2.28k| if (x == 0) return;
^723
------------------
| Branch (36:7): [True: 31.70%, False: 68.30%]
------------------
37| 1.55k| node[x].a = (a * node[x].a) % P;
38| 1.55k| node[x].b = (a * node[x].b + b) % P;
39| 1.55k| node[x].val = (a * node[x].val + b) % P;
40| 1.55k| node[x].sum = (a * node[x].sum + b * node[x].size) % P;
41| 1.55k|}
42| |
43| 5.04k|def pushdown(int x) -> void {
44| 5.04k| if (node[x].rev) {
------------------
| Branch (44:7): [True: 13.31%, False: 86.69%]
------------------
45| 671| std::swap(node[x].l, node[x].r);
46| 671| node[node[x].l].rev ^= 1;
47| 671| node[node[x].r].rev ^= 1;
48| 671| node[x].rev = 0;
49| 671| }
50| 5.04k| if ((node[x].a != 1) | (node[x].b != 0)) {
------------------
| Branch (50:7): [True: 21.84%, False: 78.16%]
------------------
51| 1.10k| affine(node[x].l, node[x].a, node[x].b);
52| 1.10k| affine(node[x].r, node[x].a, node[x].b);
53| 1.10k| node[x].a = 1;
54| 1.10k| node[x].b = 0;
55| 1.10k| }
56| 5.04k|}
57| |
58| 2.11k|def zig(int &x) -> void {
59| 2.11k| int l = node[x].l;
60| 2.11k| node[x].l = node[l].r;
61| 2.11k| maintain(x);
62| 2.11k| node[l].r = x;
63| 2.11k| x = l;
64| 2.11k|}
65| |
66| 2.13k|def zag(int &x) -> void {
67| 2.13k| int r = node[x].r;
68| 2.13k| node[x].r = node[r].l;
69| 2.13k| maintain(x);
70| 2.13k| node[r].l = x;
71| 2.13k| x = r;
72| 2.13k|}
73| |
74| 2.70k|def splay(int &x, int k) -> void {
75| 2.70k| pushdown(x);
76| 2.70k| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (76:64): [True: 13.43%, False: 86.57%]
------------------
77| 363| return;
78| 2.33k| } else if (k < size) {
------------------
| Branch (78:14): [True: 49.51%, False: 50.49%]
------------------
79| 1.15k| pushdown(l);
80| 1.15k| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (80:69): [True: 21.16%, False: 78.84%]
------------------
81| 245| zig(x);
82| 913| } else if (k < size) {
------------------
| Branch (82:16): [True: 58.82%, False: 41.18%]
------------------
83| 537| splay(ll, k);
84| 537| zig(x);
85| 537| zig(x);
86| 537| } else {
87| 376| splay(lr, k - size - 1);
88| 376| zag(l);
89| 376| zig(x);
90| 376| }
91| 1.18k| } else {
92| 1.18k| pushdown(r);
93| 1.18k| k -= size + 1;
94| 1.18k| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (94:69): [True: 15.41%, False: 84.59%]
------------------
95| 182| zag(x);
96| 999| } else if (k < size) {
------------------
| Branch (96:16): [True: 41.94%, False: 58.06%]
------------------
97| 419| splay(rl, k);
98| 419| zig(r);
99| 419| zag(x);
100| 580| } else {
101| 580| splay(rr, k - size - 1);
102| 580| zag(x);
103| 580| zag(x);
104| 580| }
105| 1.18k| }
106| 2.70k|}
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| 485| for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
^484 ^484
------------------
| Branch (115:19): [True: 99.79%, False: 0.21%]
------------------
116| 89| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^88 ^88
------------------
| Branch (116:19): [True: 98.88%, False: 1.12%]
------------------
117| 1| int x = build(1, n += 2);
118| 396| while (q--) {
------------------
| Branch (118:10): [True: 99.75%, False: 0.25%]
------------------
119| 395| let t = rd.u1();
120| 395| if (t == 0) {
------------------
| Branch (120:9): [True: 18.99%, False: 81.01%]
------------------
121| 75| ++n;
122| 75| int k = rd.uh();
123| 75| node[n].val = node[n].sum = rd.uw();
124| 75| splay(x, k);
125| 75| splay(node[x].r, 0);
126| 75| node[node[x].r].l = n;
127| 75| }
128| 395| if (t == 1) {
------------------
| Branch (128:9): [True: 22.03%, False: 77.97%]
------------------
129| 87| int k = rd.uh();
130| 87| splay(x, k);
131| 87| splay(node[x].r, 1);
132| 87| node[node[x].r].l = 0;
133| 87| }
134| 395| if (t == 2) {
------------------
| Branch (134:9): [True: 18.23%, False: 81.77%]
------------------
135| 72| int l = rd.uh();
136| 72| int r = rd.uh();
137| 72| splay(x, l);
138| 72| splay(node[x].r, r - l);
139| 72| reverse(node[node[x].r].l);
140| 72| }
141| 395| if (t == 3) {
------------------
| Branch (141:9): [True: 20.00%, False: 80.00%]
------------------
142| 79| int l = rd.uh();
143| 79| int r = rd.uh();
144| 79| splay(x, l);
145| 79| splay(node[x].r, r - l);
146| 79| int a = rd.uw();
147| 79| int b = rd.uw();
148| 79| affine(node[node[x].r].l, a, b);
149| 79| }
150| 395| if (t == 4) {
------------------
| Branch (150:9): [True: 20.76%, False: 79.24%]
------------------
151| 82| int l = rd.uh();
152| 82| int r = rd.uh();
153| 82| splay(x, l);
154| 82| splay(node[x].r, r - l);
155| 82| wt.ud(node[node[node[x].r].l].sum);
156| 82| }
157| 395| }
158| 1| return 0;
159| 1|}