/tmp/solutions/build/range_reverse_range_sum-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |constexpr int N = 200003;
7| |
8| |struct Node {
9| | int val;
10| | u64 sum;
11| | int rev;
12| | int size;
13| | int l, r;
14| |} node[N];
15| |
16| 8.31M|def maintain(int x) -> void {
17| 8.31M| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
18| 8.31M| node[x].sum = node[node[x].l].sum + node[x].val + node[node[x].r].sum;
19| 8.31M|}
20| |
21| 294k|def build(int l, int r) -> int {
22| 294k| if (l > r) return 0;
^147k
------------------
| Branch (22:7): [True: 50.00%, False: 50.00%]
------------------
23| 147k| int m = (l + r) / 2;
24| 147k| node[m].l = build(l, m - 1);
25| 147k| node[m].r = build(m + 1, r);
26| 147k| maintain(m);
27| 147k| return m;
28| 294k|}
29| |
30| 8.54M|def pushdown(int x) -> void {
31| 8.54M| if (node[x].rev) {
------------------
| Branch (31:7): [True: 39.86%, False: 60.14%]
------------------
32| 3.40M| std::swap(node[x].l, node[x].r);
33| 3.40M| node[node[x].l].rev ^= 1;
34| 3.40M| node[node[x].r].rev ^= 1;
35| 3.40M| node[x].rev = 0;
36| 3.40M| }
37| 8.54M|}
38| |
39| 96.2k|def reverse(int x) -> void {
40| 96.2k| if (x == 0) return;
^2
------------------
| Branch (40:7): [True: 0.00%, False: 100.00%]
------------------
41| 96.2k| node[x].rev ^= 1;
42| 96.2k|}
43| |
44| 4.06M|def zig(int &x) -> void {
45| 4.06M| int l = node[x].l;
46| 4.06M| node[x].l = node[l].r;
47| 4.06M| maintain(x);
48| 4.06M| node[l].r = x;
49| 4.06M| x = l;
50| 4.06M|}
51| |
52| 4.10M|def zag(int &x) -> void {
53| 4.10M| int r = node[x].r;
54| 4.10M| node[x].r = node[r].l;
55| 4.10M| maintain(x);
56| 4.10M| node[r].l = x;
57| 4.10M| x = r;
58| 4.10M|}
59| |
60| 4.37M|def splay(int &x, int k) -> void {
61| 4.37M| pushdown(x);
62| 4.37M| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (62:64): [True: 4.39%, False: 95.61%]
------------------
63| 191k| return;
64| 4.17M| } else if (k < size) {
------------------
| Branch (64:14): [True: 49.34%, False: 50.66%]
------------------
65| 2.06M| pushdown(l);
66| 2.06M| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (66:69): [True: 4.69%, False: 95.31%]
------------------
67| 96.7k| zig(x);
68| 1.96M| } else if (k < size) {
------------------
| Branch (68:16): [True: 48.34%, False: 51.66%]
------------------
69| 949k| splay(ll, k);
70| 949k| zig(x);
71| 949k| zig(x);
72| 1.01M| } else {
73| 1.01M| splay(lr, k - size - 1);
74| 1.01M| zag(l);
75| 1.01M| zig(x);
76| 1.01M| }
77| 2.11M| } else {
78| 2.11M| pushdown(r);
79| 2.11M| k -= size + 1;
80| 2.11M| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (80:69): [True: 4.55%, False: 95.45%]
------------------
81| 96.3k| zag(x);
82| 2.02M| } else if (k < size) {
------------------
| Branch (82:16): [True: 51.96%, False: 48.04%]
------------------
83| 1.04M| splay(rl, k);
84| 1.04M| zig(r);
85| 1.04M| zag(x);
86| 1.04M| } else {
87| 970k| splay(rr, k - size - 1);
88| 970k| zag(x);
89| 970k| zag(x);
90| 970k| }
91| 2.11M| }
92| 4.37M|}
93| |
94| |} // namespace
95| |
96| 1|int main() {
97| 1| rd rd;
98| 1| wt wt;
99| 1| int n = rd.uh();
100| 1| int q = rd.uh();
101| 1|#ifdef LOCAL
102| 1| std::memset(node, 0, sizeof(Node) * (n + 3));
103| 1|#endif
104| 147k| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^147k^147k
------------------
| Branch (104:19): [True: 100.00%, False: 0.00%]
------------------
105| 1| int x = build(1, n + 2);
106| 1| if (n == 0) rd.skip(1);
^0
------------------
| Branch (106:7): [True: 0.00%, False: 100.00%]
------------------
107| 192k| while (q--) {
------------------
| Branch (107:10): [True: 100.00%, False: 0.00%]
------------------
108| 192k| int t = rd.u1();
109| 192k| int l = rd.uh();
110| 192k| int r = rd.uh();
111| 192k| splay(x, l);
112| 192k| splay(node[x].r, r - l);
113| 192k| if (t == 0) {
------------------
| Branch (113:9): [True: 50.01%, False: 49.99%]
------------------
114| 96.2k| reverse(node[node[x].r].l);
115| 96.2k| }
116| 192k| if (t == 1) {
------------------
| Branch (116:9): [True: 49.99%, False: 50.01%]
------------------
117| 96.2k| wt.ud(node[node[node[x].r].l].sum);
118| 96.2k| }
119| 192k| }
120| 1| return 0;
121| 1|}