/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| 8.97k|def maintain(int x) -> void {
20| 8.97k| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
21| 8.97k| node[x].sum = (node[node[x].l].sum + node[x].val + node[node[x].r].sum) % P;
22| 8.97k|}
23| |
24| 199|def build(int l, int r) -> int {
25| 199| if (l > r) return 0;
^100
------------------
| Branch (25:7): [True: 50.25%, False: 49.75%]
------------------
26| 99| int m = (l + r) / 2;
27| 99| node[m].l = build(l, m - 1);
28| 99| node[m].r = build(m + 1, r);
29| 99| maintain(m);
30| 99| return m;
31| 199|}
32| |
33| 143|def reverse(int x) -> void { node[x].rev ^= 1; }
34| |
35| 4.87k|def affine(int x, u64 a, u64 b) -> void {
36| 4.87k| if (x == 0) return;
^1.59k
------------------
| Branch (36:7): [True: 32.75%, False: 67.25%]
------------------
37| 3.28k| node[x].a = (a * node[x].a) % P;
38| 3.28k| node[x].b = (a * node[x].b + b) % P;
39| 3.28k| node[x].val = (a * node[x].val + b) % P;
40| 3.28k| node[x].sum = (a * node[x].sum + b * node[x].size) % P;
41| 3.28k|}
42| |
43| 10.4k|def pushdown(int x) -> void {
44| 10.4k| if (node[x].rev) {
------------------
| Branch (44:7): [True: 15.27%, False: 84.73%]
------------------
45| 1.59k| std::swap(node[x].l, node[x].r);
46| 1.59k| node[node[x].l].rev ^= 1;
47| 1.59k| node[node[x].r].rev ^= 1;
48| 1.59k| node[x].rev = 0;
49| 1.59k| }
50| 10.4k| if ((node[x].a != 1) | (node[x].b != 0)) {
------------------
| Branch (50:7): [True: 22.54%, False: 77.46%]
------------------
51| 2.35k| affine(node[x].l, node[x].a, node[x].b);
52| 2.35k| affine(node[x].r, node[x].a, node[x].b);
53| 2.35k| node[x].a = 1;
54| 2.35k| node[x].b = 0;
55| 2.35k| }
56| 10.4k|}
57| |
58| 4.56k|def zig(int &x) -> void {
59| 4.56k| int l = node[x].l;
60| 4.56k| node[x].l = node[l].r;
61| 4.56k| maintain(x);
62| 4.56k| node[l].r = x;
63| 4.56k| x = l;
64| 4.56k|}
65| |
66| 4.31k|def zag(int &x) -> void {
67| 4.31k| int r = node[x].r;
68| 4.31k| node[x].r = node[r].l;
69| 4.31k| maintain(x);
70| 4.31k| node[r].l = x;
71| 4.31k| x = r;
72| 4.31k|}
73| |
74| 5.63k|def splay(int &x, int k) -> void {
75| 5.63k| pushdown(x);
76| 5.63k| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (76:64): [True: 14.42%, False: 85.58%]
------------------
77| 813| return;
78| 4.82k| } else if (k < size) {
------------------
| Branch (78:14): [True: 52.19%, False: 47.81%]
------------------
79| 2.51k| pushdown(l);
80| 2.51k| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (80:69): [True: 19.30%, False: 80.70%]
------------------
81| 486| zig(x);
82| 2.03k| } else if (k < size) {
------------------
| Branch (82:16): [True: 58.86%, False: 41.14%]
------------------
83| 1.19k| splay(ll, k);
84| 1.19k| zig(x);
85| 1.19k| zig(x);
86| 1.19k| } else {
87| 836| splay(lr, k - size - 1);
88| 836| zag(l);
89| 836| zig(x);
90| 836| }
91| 2.51k| } else {
92| 2.30k| pushdown(r);
93| 2.30k| k -= size + 1;
94| 2.30k| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (94:69): [True: 12.35%, False: 87.65%]
------------------
95| 285| zag(x);
96| 2.02k| } else if (k < size) {
------------------
| Branch (96:16): [True: 41.94%, False: 58.06%]
------------------
97| 848| splay(rl, k);
98| 848| zig(r);
99| 848| zag(x);
100| 1.17k| } else {
101| 1.17k| splay(rr, k - size - 1);
102| 1.17k| zag(x);
103| 1.17k| zag(x);
104| 1.17k| }
105| 2.30k| }
106| 5.63k|}
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| 891| for (int i = 1; i <= n + q + 1; ++i) node[i] = Node{.a = 1, .size = 1};
^890 ^890
------------------
| Branch (115:19): [True: 99.89%, False: 0.11%]
------------------
116| 98| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^97 ^97
------------------
| Branch (116:19): [True: 98.98%, False: 1.02%]
------------------
117| 1| int x = build(1, n += 2);
118| 793| while (q--) {
------------------
| Branch (118:10): [True: 99.87%, False: 0.13%]
------------------
119| 792| let t = rd.u1();
120| 792| if (t == 0) {
------------------
| Branch (120:9): [True: 18.81%, False: 81.19%]
------------------
121| 149| ++n;
122| 149| int k = rd.uh();
123| 149| node[n].val = node[n].sum = rd.uw();
124| 149| splay(x, k);
125| 149| splay(node[x].r, 0);
126| 149| node[node[x].r].l = n;
127| 149| }
128| 792| if (t == 1) {
------------------
| Branch (128:9): [True: 22.98%, False: 77.02%]
------------------
129| 182| int k = rd.uh();
130| 182| splay(x, k);
131| 182| splay(node[x].r, 1);
132| 182| node[node[x].r].l = 0;
133| 182| }
134| 792| if (t == 2) {
------------------
| Branch (134:9): [True: 18.06%, False: 81.94%]
------------------
135| 143| int l = rd.uh();
136| 143| int r = rd.uh();
137| 143| splay(x, l);
138| 143| splay(node[x].r, r - l);
139| 143| reverse(node[node[x].r].l);
140| 143| }
141| 792| if (t == 3) {
------------------
| Branch (141:9): [True: 20.33%, False: 79.67%]
------------------
142| 161| int l = rd.uh();
143| 161| int r = rd.uh();
144| 161| splay(x, l);
145| 161| splay(node[x].r, r - l);
146| 161| int a = rd.uw();
147| 161| int b = rd.uw();
148| 161| affine(node[node[x].r].l, a, b);
149| 161| }
150| 792| if (t == 4) {
------------------
| Branch (150:9): [True: 19.82%, False: 80.18%]
------------------
151| 157| int l = rd.uh();
152| 157| int r = rd.uh();
153| 157| splay(x, l);
154| 157| splay(node[x].r, r - l);
155| 157| wt.ud(node[node[node[x].r].l].sum);
156| 157| }
157| 792| }
158| 1| return 0;
159| 1|}