/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| 5.79k|def maintain(int x) -> void {
20| 5.79k| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
21| 5.79k| node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
22| 5.79k|}
23| |
24| 1.80k|def build(int l, int r) -> int {
25| 1.80k| if (l > r) return 0;
^905
------------------
| Branch (25:7): [True: 50.03%, False: 49.97%]
------------------
26| 904| int m = (l + r) / 2;
27| 904| node[m].l = build(l, m - 1);
28| 904| node[m].r = build(m + 1, r);
29| 904| maintain(m);
30| 904| return m;
31| 1.80k|}
32| |
33| 56|def reverse(int x) -> void { node[x].rev ^= 1; }
34| |
35| 3.74k|def affine(int x, u64 a, u64 b) -> void {
36| 3.74k| if (x == 0) return;
^667
------------------
| Branch (36:7): [True: 17.83%, False: 82.17%]
------------------
37| 3.07k| node[x].a = (a * node[x].a) % P;
38| 3.07k| node[x].b = (a * node[x].b + b) % P;
39| 3.07k| node[x].val = (a * node[x].val + b) % P;
40| 3.07k| node[x].sum = (a * node[x].sum + b * node[x].size) % P;
41| 3.07k|}
42| |
43| 5.39k|def pushdown(int x) -> void {
44| 5.39k| if (node[x].rev) {
------------------
| Branch (44:7): [True: 23.85%, False: 76.15%]
------------------
45| 1.28k| std::swap(node[x].l, node[x].r);
46| 1.28k| node[node[x].l].rev ^= 1;
47| 1.28k| node[node[x].r].rev ^= 1;
48| 1.28k| node[x].rev = 0;
49| 1.28k| }
50| 5.39k| if ((node[x].a != 1) | (node[x].b != 0)) {
------------------
| Branch (50:7): [True: 34.31%, False: 65.69%]
------------------
51| 1.85k| affine(node[x].l, node[x].a, node[x].b);
52| 1.85k| affine(node[x].r, node[x].a, node[x].b);
53| 1.85k| node[x].a = 1;
54| 1.85k| node[x].b = 0;
55| 1.85k| }
56| 5.39k|}
57| |
58| 2.55k|def zig(int &x) -> void {
59| 2.55k| int l = node[x].l;
60| 2.55k| node[x].l = node[l].r;
61| 2.55k| maintain(x);
62| 2.55k| node[l].r = x;
63| 2.55k| x = l;
64| 2.55k|}
65| |
66| 2.33k|def zag(int &x) -> void {
67| 2.33k| int r = node[x].r;
68| 2.33k| node[x].r = node[r].l;
69| 2.33k| maintain(x);
70| 2.33k| node[r].l = x;
71| 2.33k| x = r;
72| 2.33k|}
73| |
74| 2.82k|def splay(int &x, int k) -> void {
75| 2.82k| pushdown(x);
76| 2.82k| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (76:64): [True: 9.20%, False: 90.80%]
------------------
77| 260| return;
78| 2.56k| } else if (k < size) {
------------------
| Branch (78:14): [True: 52.03%, False: 47.97%]
------------------
79| 1.33k| pushdown(l);
80| 1.33k| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (80:69): [True: 10.56%, False: 89.44%]
------------------
81| 141| zig(x);
82| 1.19k| } else if (k < size) {
------------------
| Branch (82:16): [True: 59.21%, False: 40.79%]
------------------
83| 707| splay(ll, k);
84| 707| zig(x);
85| 707| zig(x);
86| 707| } else {
87| 487| splay(lr, k - size - 1);
88| 487| zag(l);
89| 487| zig(x);
90| 487| }
91| 1.33k| } else {
92| 1.23k| pushdown(r);
93| 1.23k| k -= size + 1;
94| 1.23k| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (94:69): [True: 8.37%, False: 91.63%]
------------------
95| 103| zag(x);
96| 1.12k| } else if (k < size) {
------------------
| Branch (96:16): [True: 45.12%, False: 54.88%]
------------------
97| 509| splay(rl, k);
98| 509| zig(r);
99| 509| zag(x);
100| 619| } else {
101| 619| splay(rr, k - size - 1);
102| 619| zag(x);
103| 619| zag(x);
104| 619| }
105| 1.23k| }
106| 2.82k|}
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.15k| for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
^1.15k^1.15k
------------------
| Branch (115:19): [True: 99.91%, False: 0.09%]
------------------
116| 903| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^902 ^902
------------------
| Branch (116:19): [True: 99.89%, False: 0.11%]
------------------
117| 1| int x = build(1, n += 2);
118| 253| while (q--) {
------------------
| Branch (118:10): [True: 99.60%, False: 0.40%]
------------------
119| 252| let t = rd.u1();
120| 252| if (t == 0) {
------------------
| Branch (120:9): [True: 22.22%, False: 77.78%]
------------------
121| 56| ++n;
122| 56| int k = rd.uh();
123| 56| node[n].val = node[n].sum = rd.uw();
124| 56| splay(x, k);
125| 56| splay(node[x].r, 0);
126| 56| node[node[x].r].l = n;
127| 56| }
128| 252| if (t == 1) {
------------------
| Branch (128:9): [True: 20.63%, False: 79.37%]
------------------
129| 52| int k = rd.uh();
130| 52| splay(x, k);
131| 52| splay(node[x].r, 1);
132| 52| node[node[x].r].l = 0;
133| 52| }
134| 252| if (t == 2) {
------------------
| Branch (134:9): [True: 22.22%, False: 77.78%]
------------------
135| 56| int l = rd.uh();
136| 56| int r = rd.uh();
137| 56| splay(x, l);
138| 56| splay(node[x].r, r - l);
139| 56| reverse(node[node[x].r].l);
140| 56| }
141| 252| if (t == 3) {
------------------
| Branch (141:9): [True: 16.27%, False: 83.73%]
------------------
142| 41| int l = rd.uh();
143| 41| int r = rd.uh();
144| 41| splay(x, l);
145| 41| splay(node[x].r, r - l);
146| 41| int a = rd.uw();
147| 41| int b = rd.uw();
148| 41| affine(node[node[x].r].l, a, b);
149| 41| }
150| 252| if (t == 4) {
------------------
| Branch (150:9): [True: 18.65%, False: 81.35%]
------------------
151| 47| int l = rd.uh();
152| 47| int r = rd.uh();
153| 47| splay(x, l);
154| 47| splay(node[x].r, r - l);
155| 47| wt.ud(node[node[node[x].r].l].sum);
156| 47| }
157| 252| }
158| 1| return 0;
159| 1|}