/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| 1.90M|def maintain(int x) -> void {
17| 1.90M| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
18| 1.90M| node[x].sum = node[node[x].l].sum + node[x].val + node[node[x].r].sum;
19| 1.90M|}
20| |
21| 485|def build(int l, int r) -> int {
22| 485| if (l > r) return 0;
^243
------------------
| Branch (22:7): [True: 50.10%, False: 49.90%]
------------------
23| 242| int m = (l + r) / 2;
24| 242| node[m].l = build(l, m - 1);
25| 242| node[m].r = build(m + 1, r);
26| 242| maintain(m);
27| 242| return m;
28| 485|}
29| |
30| 2.14M|def pushdown(int x) -> void {
31| 2.14M| if (node[x].rev) {
------------------
| Branch (31:7): [True: 27.44%, False: 72.56%]
------------------
32| 588k| std::swap(node[x].l, node[x].r);
33| 588k| node[node[x].l].rev ^= 1;
34| 588k| node[node[x].r].rev ^= 1;
35| 588k| node[x].rev = 0;
36| 588k| }
37| 2.14M|}
38| |
39| 60.0k|def reverse(int x) -> void {
40| 60.0k| if (x == 0) return;
^526
------------------
| Branch (40:7): [True: 0.88%, False: 99.12%]
------------------
41| 59.4k| node[x].rev ^= 1;
42| 59.4k|}
43| |
44| 938k|def zig(int &x) -> void {
45| 938k| int l = node[x].l;
46| 938k| node[x].l = node[l].r;
47| 938k| maintain(x);
48| 938k| node[l].r = x;
49| 938k| x = l;
50| 938k|}
51| |
52| 964k|def zag(int &x) -> void {
53| 964k| int r = node[x].r;
54| 964k| node[x].r = node[r].l;
55| 964k| maintain(x);
56| 964k| node[r].l = x;
57| 964k| x = r;
58| 964k|}
59| |
60| 1.13M|def splay(int &x, int k) -> void {
61| 1.13M| pushdown(x);
62| 1.13M| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (62:64): [True: 10.67%, False: 89.33%]
------------------
63| 120k| return;
64| 1.01M| } else if (k < size) {
------------------
| Branch (64:14): [True: 48.34%, False: 51.66%]
------------------
65| 489k| pushdown(l);
66| 489k| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (66:69): [True: 12.51%, False: 87.49%]
------------------
67| 61.2k| zig(x);
68| 427k| } else if (k < size) {
------------------
| Branch (68:16): [True: 50.34%, False: 49.66%]
------------------
69| 215k| splay(ll, k);
70| 215k| zig(x);
71| 215k| zig(x);
72| 215k| } else {
73| 212k| splay(lr, k - size - 1);
74| 212k| zag(l);
75| 212k| zig(x);
76| 212k| }
77| 522k| } else {
78| 522k| pushdown(r);
79| 522k| k -= size + 1;
80| 522k| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (80:69): [True: 11.30%, False: 88.70%]
------------------
81| 59.0k| zag(x);
82| 463k| } else if (k < size) {
------------------
| Branch (82:16): [True: 50.49%, False: 49.51%]
------------------
83| 234k| splay(rl, k);
84| 234k| zig(r);
85| 234k| zag(x);
86| 234k| } else {
87| 229k| splay(rr, k - size - 1);
88| 229k| zag(x);
89| 229k| zag(x);
90| 229k| }
91| 522k| }
92| 1.13M|}
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| 241| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^240 ^240
------------------
| Branch (104:19): [True: 99.59%, False: 0.41%]
------------------
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| 120k| while (q--) {
------------------
| Branch (107:10): [True: 100.00%, False: 0.00%]
------------------
108| 120k| int t = rd.u1();
109| 120k| int l = rd.uh();
110| 120k| int r = rd.uh();
111| 120k| splay(x, l);
112| 120k| splay(node[x].r, r - l);
113| 120k| if (t == 0) {
------------------
| Branch (113:9): [True: 49.76%, False: 50.24%]
------------------
114| 60.0k| reverse(node[node[x].r].l);
115| 60.0k| }
116| 120k| if (t == 1) {
------------------
| Branch (116:9): [True: 50.24%, False: 49.76%]
------------------
117| 60.5k| wt.ud(node[node[node[x].r].l].sum);
118| 60.5k| }
119| 120k| }
120| 1| return 0;
121| 1|}