/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| 4.17M|def maintain(int x) -> void {
18| 4.17M| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
19| 4.17M| node[x].sum = node[node[x].l].sum + node[x].val + node[node[x].r].sum;
20| 4.17M|}
21| |
22| 4.22M|def pushdown(int x) -> void {
23| 4.22M| if (node[x].rev) {
------------------
| Branch (23:7): [True: 21.01%, False: 78.99%]
------------------
24| 888k| std::swap(node[x].l, node[x].r);
25| 888k| node[node[x].l].rev ^= 1;
26| 888k| node[node[x].r].rev ^= 1;
27| 888k| node[x].rev = 0;
28| 888k| }
29| 4.22M|}
30| |
31| 60.0k|def reverse(int x) -> void {
32| 60.0k| if (x == 0) return;
^526
------------------
| Branch (32:7): [True: 0.88%, False: 99.12%]
------------------
33| 59.4k| node[x].rev ^= 1;
34| 59.4k| pushdown(x);
35| 59.4k|}
36| |
37| 2.08M|def merge(int x, int y) -> int {
38| 2.08M| if (x == 0) return y;
^121k
------------------
| Branch (38:7): [True: 5.82%, False: 94.18%]
------------------
39| 1.96M| if (y == 0) return x;
^119k
------------------
| Branch (39:7): [True: 6.10%, False: 93.90%]
------------------
40| 1.84M| if (node[x].pri > node[y].pri) {
------------------
| Branch (40:7): [True: 46.98%, False: 53.02%]
------------------
41| 867k| pushdown(x);
42| 867k| node[x].r = merge(node[x].r, y);
43| 867k| maintain(x);
44| 867k| return x;
45| 978k| } else {
46| 978k| pushdown(y);
47| 978k| node[y].l = merge(x, node[y].l);
48| 978k| maintain(y);
49| 978k| return y;
50| 978k| }
51| 1.84M|}
52| |
53| 2.56M|def split(int x, int k) -> std::pair<int, int> {
54| 2.56M| if (x == 0) return {0, 0};
^241k
------------------
| Branch (54:7): [True: 9.40%, False: 90.60%]
------------------
55| 2.32M| pushdown(x);
56| 2.32M| if (int size = node[node[x].l].size; k <= size) {
------------------
| Branch (56:40): [True: 52.62%, False: 47.38%]
------------------
57| 1.22M| let[a, b] = split(node[x].l, k);
58| 1.22M| node[x].l = b;
59| 1.22M| maintain(x);
60| 1.22M| return {a, x};
61| 1.22M| } else {
62| 1.10M| let[a, b] = split(node[x].r, k - size - 1);
63| 1.10M| node[x].r = a;
64| 1.10M| maintain(x);
65| 1.10M| return {x, b};
66| 1.10M| }
67| 2.32M|}
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| 241| for (int i = 1; i <= n; ++i) {
^240
------------------
| Branch (80:19): [True: 99.59%, False: 0.41%]
------------------
81| 240| node[i].size = 1;
82| 240| node[i].pri = node[i].sum = node[i].val = rd.uw();
83| 240| x = merge(x, i);
84| 240| }
85| 1| if (n == 0) rd.skip(1);
^0
------------------
| Branch (85:7): [True: 0.00%, False: 100.00%]
------------------
86| 120k| while (q--) {
------------------
| Branch (86:10): [True: 100.00%, False: 0.00%]
------------------
87| 120k| int t = rd.u1();
88| 120k| int l = rd.uh();
89| 120k| int r = rd.uh();
90| 120k| let[a, b] = split(x, l);
91| 120k| let[c, d] = split(b, r - l);
92| 120k| if (t == 0) {
------------------
| Branch (92:9): [True: 49.76%, False: 50.24%]
------------------
93| 60.0k| reverse(c);
94| 60.0k| }
95| 120k| if (t == 1) {
------------------
| Branch (95:9): [True: 50.24%, False: 49.76%]
------------------
96| 60.5k| wt.ud(node[c].sum);
97| 60.5k| }
98| 120k| x = merge(a, merge(c, d));
99| 120k| }
100| 1| return 0;
101| 1|}