/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| 1.68M|def maintain(int x) -> void {
18| 1.68M| node[x].size = node[node[x].l].size + 1 + node[node[x].r].size;
19| 1.68M| node[x].sum = node[node[x].l].sum + node[x].val + node[node[x].r].sum;
20| 1.68M|}
21| |
22| 1.68M|def pushdown(int x) -> void {
23| 1.68M| if (node[x].rev) {
------------------
| Branch (23:7): [True: 0.00%, False: 100.00%]
------------------
24| 22| std::swap(node[x].l, node[x].r);
25| 22| node[node[x].l].rev ^= 1;
26| 22| node[node[x].r].rev ^= 1;
27| 22| node[x].rev = 0;
28| 22| }
29| 1.68M|}
30| |
31| 1|def reverse(int x) -> void {
32| 1| if (x == 0) return;
^0
------------------
| Branch (32:7): [True: 0.00%, False: 100.00%]
------------------
33| 1| node[x].rev ^= 1;
34| 1| pushdown(x);
35| 1|}
36| |
37| 1.83M|def merge(int x, int y) -> int {
38| 1.83M| if (x == 0) return y;
^75.7k
------------------
| Branch (38:7): [True: 4.12%, False: 95.88%]
------------------
39| 1.76M| if (y == 0) return x;
^75.9k
------------------
| Branch (39:7): [True: 4.31%, False: 95.69%]
------------------
40| 1.68M| if (node[x].pri > node[y].pri) {
------------------
| Branch (40:7): [True: 95.50%, False: 4.50%]
------------------
41| 1.61M| pushdown(x);
42| 1.61M| node[x].r = merge(node[x].r, y);
43| 1.61M| maintain(x);
44| 1.61M| return x;
45| 1.61M| } else {
46| 75.9k| pushdown(y);
47| 75.9k| node[y].l = merge(x, node[y].l);
48| 75.9k| maintain(y);
49| 75.9k| return y;
50| 75.9k| }
51| 1.68M|}
52| |
53| 55|def split(int x, int k) -> std::pair<int, int> {
54| 55| if (x == 0) return {0, 0};
^2
------------------
| Branch (54:7): [True: 3.64%, False: 96.36%]
------------------
55| 53| pushdown(x);
56| 53| if (int size = node[node[x].l].size; k <= size) {
------------------
| Branch (56:40): [True: 43.40%, False: 56.60%]
------------------
57| 23| let[a, b] = split(node[x].l, k);
58| 23| node[x].l = b;
59| 23| maintain(x);
60| 23| return {a, x};
61| 30| } else {
62| 30| let[a, b] = split(node[x].r, k - size - 1);
63| 30| node[x].r = a;
64| 30| maintain(x);
65| 30| return {x, b};
66| 30| }
67| 53|}
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| 151k| for (int i = 1; i <= n; ++i) {
^151k
------------------
| Branch (80:19): [True: 100.00%, False: 0.00%]
------------------
81| 151k| node[i].size = 1;
82| 151k| node[i].pri = node[i].sum = node[i].val = rd.uw();
83| 151k| x = merge(x, i);
84| 151k| }
85| 1| if (n == 0) rd.skip(1);
^0
------------------
| Branch (85:7): [True: 0.00%, False: 100.00%]
------------------
86| 2| while (q--) {
------------------
| Branch (86:10): [True: 50.00%, False: 50.00%]
------------------
87| 1| int t = rd.u1();
88| 1| int l = rd.uh();
89| 1| int r = rd.uh();
90| 1| let[a, b] = split(x, l);
91| 1| let[c, d] = split(b, r - l);
92| 1| if (t == 0) {
------------------
| Branch (92:9): [True: 100.00%, False: 0.00%]
------------------
93| 1| reverse(c);
94| 1| }
95| 1| if (t == 1) {
------------------
| Branch (95:9): [True: 0.00%, False: 100.00%]
------------------
96| 0| wt.ud(node[c].sum);
97| 0| }
98| 1| x = merge(a, merge(c, d));
99| 1| }
100| 1| return 0;
101| 1|}