/tmp/solutions/build/range_reverse_range_sum-slow.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |constexpr int N = 200001;
7| |
8| |struct Node {
9| | int pri;
10| | int val;
11| | u64 sum;
12| | int rev;
13| | int size;
14| | int l, r;
15| |} node[N];
16| |
17| 19.9M|def maintain(int x) -> void {
18| 19.9M| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
19| 19.9M| node[x].sum = node[node[x].l].sum + node[x].val + node[node[x].r].sum;
20| 19.9M|}
21| |
22| 20.0M|def pushdown(int x) -> void {
23| 20.0M| if (node[x].rev) {
------------------
| Branch (23:7): [True: 26.85%, False: 73.15%]
------------------
24| 5.38M| std::swap(node[x].l, node[x].r);
25| 5.38M| node[node[x].l].rev ^= 1;
26| 5.38M| node[node[x].r].rev ^= 1;
27| 5.38M| node[x].rev = 0;
28| 5.38M| }
29| 20.0M|}
30| |
31| 100k|def reverse(int x) -> void {
32| 100k| if (x == 0) return;
^0
------------------
| Branch (32:7): [True: 0.00%, False: 100.00%]
------------------
33| 100k| node[x].rev ^= 1;
34| 100k| pushdown(x);
35| 100k|}
36| |
37| 11.3M|def merge(int x, int y) -> int {
38| 11.3M| if (x == 0) return y;
^299k
------------------
| Branch (38:7): [True: 2.65%, False: 97.35%]
------------------
39| 11.0M| if (y == 0) return x;
^300k
------------------
| Branch (39:7): [True: 2.72%, False: 97.28%]
------------------
40| 10.7M| if (node[x].pri > node[y].pri) {
------------------
| Branch (40:7): [True: 58.82%, False: 41.18%]
------------------
41| 6.30M| pushdown(x);
42| 6.30M| node[x].r = merge(node[x].r, y);
43| 6.30M| maintain(x);
44| 6.30M| return x;
45| 6.30M| } else {
46| 4.41M| pushdown(y);
47| 4.41M| node[y].l = merge(x, node[y].l);
48| 4.41M| maintain(y);
49| 4.41M| return y;
50| 4.41M| }
51| 10.7M|}
52| |
53| 9.63M|def split(int x, int k) -> std::pair<int, int> {
54| 9.63M| if (x == 0) return {0, 0};
^400k
------------------
| Branch (54:7): [True: 4.15%, False: 95.85%]
------------------
55| 9.23M| pushdown(x);
56| 9.23M| if (int size = node[node[x].l].size; k <= size) {
------------------
| Branch (56:40): [True: 51.06%, False: 48.94%]
------------------
57| 4.71M| let[a, b] = split(node[x].l, k);
58| 4.71M| node[x].l = b;
59| 4.71M| maintain(x);
60| 4.71M| return {a, x};
61| 4.71M| } else {
62| 4.51M| let[a, b] = split(node[x].r, k - size - 1);
63| 4.51M| node[x].r = a;
64| 4.51M| maintain(x);
65| 4.51M| return {x, b};
66| 4.51M| }
67| 9.23M|}
68| |
69| |} // namespace
70| |
71| 1|int main() {
72| 1| rd rd;
73| 1| wt wt;
74| 1| int n = rd.uh();
75| 1| int q = rd.uh();
76| 1|#ifdef LOCAL
77| 1| std::memset(node, 0, sizeof(Node) * (n + 1));
78| 1|#endif
79| 1| int x = 0;
80| 200k| for (int i = 1; i <= n; ++i) {
^200k
------------------
| Branch (80:19): [True: 100.00%, False: 0.00%]
------------------
81| 200k| node[i].size = 1;
82| 200k| node[i].pri = node[i].sum = node[i].val = rd.uw();
83| 200k| x = merge(x, i);
84| 200k| }
85| 1| if (n == 0) rd.skip(1);
^0
------------------
| Branch (85:7): [True: 0.00%, False: 100.00%]
------------------
86| 200k| while (q--) {
------------------
| Branch (86:10): [True: 100.00%, False: 0.00%]
------------------
87| 200k| int t = rd.u1();
88| 200k| int l = rd.uh();
89| 200k| int r = rd.uh();
90| 200k| let[a, b] = split(x, l);
91| 200k| let[c, d] = split(b, r - l);
92| 200k| if (t == 0) {
------------------
| Branch (92:9): [True: 50.08%, False: 49.92%]
------------------
93| 100k| reverse(c);
94| 100k| }
95| 200k| if (t == 1) {
------------------
| Branch (95:9): [True: 49.92%, False: 50.08%]
------------------
96| 99.8k| wt.ud(node[c].sum);
97| 99.8k| }
98| 200k| x = merge(a, merge(c, d));
99| 200k| }
100| 1| return 0;
101| 1|}