/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| 22|def maintain(int x) -> void {
17| 22| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
18| 22| node[x].sum = node[node[x].l].sum + node[x].val + node[node[x].r].sum;
19| 22|}
20| |
21| 13|def build(int l, int r) -> int {
22| 13| if (l > r) return 0;
^7
------------------
| Branch (22:7): [True: 53.85%, False: 46.15%]
------------------
23| 6| int m = (l + r) / 2;
24| 6| node[m].l = build(l, m - 1);
25| 6| node[m].r = build(m + 1, r);
26| 6| maintain(m);
27| 6| return m;
28| 13|}
29| |
30| 26|def pushdown(int x) -> void {
31| 26| if (node[x].rev) {
------------------
| Branch (31:7): [True: 7.69%, False: 92.31%]
------------------
32| 2| std::swap(node[x].l, node[x].r);
33| 2| node[node[x].l].rev ^= 1;
34| 2| node[node[x].r].rev ^= 1;
35| 2| node[x].rev = 0;
36| 2| }
37| 26|}
38| |
39| 2|def reverse(int x) -> void {
40| 2| if (x == 0) return;
^1
------------------
| Branch (40:7): [True: 50.00%, False: 50.00%]
------------------
41| 1| node[x].rev ^= 1;
42| 1|}
43| |
44| 8|def zig(int &x) -> void {
45| 8| int l = node[x].l;
46| 8| node[x].l = node[l].r;
47| 8| maintain(x);
48| 8| node[l].r = x;
49| 8| x = l;
50| 8|}
51| |
52| 8|def zag(int &x) -> void {
53| 8| int r = node[x].r;
54| 8| node[x].r = node[r].l;
55| 8| maintain(x);
56| 8| node[r].l = x;
57| 8| x = r;
58| 8|}
59| |
60| 16|def splay(int &x, int k) -> void {
61| 16| pushdown(x);
62| 16| if (int &l = node[x].l, &r = node[x].r, size = node[l].size; k == size) {
------------------
| Branch (62:64): [True: 37.50%, False: 62.50%]
------------------
63| 6| return;
64| 10| } else if (k < size) {
------------------
| Branch (64:14): [True: 50.00%, False: 50.00%]
------------------
65| 5| pushdown(l);
66| 5| if (int &ll = node[l].l, &lr = node[l].r, size = node[ll].size; k == size) {
------------------
| Branch (66:69): [True: 20.00%, False: 80.00%]
------------------
67| 1| zig(x);
68| 4| } else if (k < size) {
------------------
| Branch (68:16): [True: 50.00%, False: 50.00%]
------------------
69| 2| splay(ll, k);
70| 2| zig(x);
71| 2| zig(x);
72| 2| } else {
73| 2| splay(lr, k - size - 1);
74| 2| zag(l);
75| 2| zig(x);
76| 2| }
77| 5| } else {
78| 5| pushdown(r);
79| 5| k -= size + 1;
80| 5| if (int &rl = node[r].l, &rr = node[r].r, size = node[rl].size; k == size) {
------------------
| Branch (80:69): [True: 60.00%, False: 40.00%]
------------------
81| 3| zag(x);
82| 3| } else if (k < size) {
^2 ^2
------------------
| Branch (82:16): [True: 50.00%, False: 50.00%]
------------------
83| 1| splay(rl, k);
84| 1| zig(r);
85| 1| zag(x);
86| 1| } else {
87| 1| splay(rr, k - size - 1);
88| 1| zag(x);
89| 1| zag(x);
90| 1| }
91| 5| }
92| 16|}
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| 5| for (int i = 2; i <= n + 1; ++i) node[i].val = rd.uw();
^4 ^4
------------------
| Branch (104:19): [True: 80.00%, False: 20.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| 6| while (q--) {
------------------
| Branch (107:10): [True: 83.33%, False: 16.67%]
------------------
108| 5| int t = rd.u1();
109| 5| int l = rd.uh();
110| 5| int r = rd.uh();
111| 5| splay(x, l);
112| 5| splay(node[x].r, r - l);
113| 5| if (t == 0) {
------------------
| Branch (113:9): [True: 40.00%, False: 60.00%]
------------------
114| 2| reverse(node[node[x].r].l);
115| 2| }
116| 5| if (t == 1) {
------------------
| Branch (116:9): [True: 60.00%, False: 40.00%]
------------------
117| 3| wt.ud(node[node[node[x].r].l].sum);
118| 3| }
119| 5| }
120| 1| return 0;
121| 1|}