/tmp/solutions/build/predecessor_problem-main.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |u64 root;
7| |u64 lv18[39];
8| |u64 lv12[2442];
9| |u64 leaf[156250];
10| |
11| 199k|void set(u32 x) {
12| 199k| leaf[x >> 6] |= 1ull << (x & 63);
13| 199k| lv12[x >> 12] |= 1ull << ((x >> 6) & 63);
14| 199k| lv18[x >> 18] |= 1ull << ((x >> 12) & 63);
15| 199k| root |= 1ull << (x >> 18);
16| 199k|}
17| |
18| 199k|void unset(u32 x) {
19| 199k| if (!(leaf[x >> 6] &= ~(1ull << (x & 63))))
------------------
| Branch (19:7): [True: 0.00%, False: 100.00%]
------------------
20| 0| if (!(lv12[x >> 12] &= ~(1ull << ((x >> 6) & 63))))
------------------
| Branch (20:9): [True: 0.00%, False: 0.00%]
------------------
21| 0| if (!(lv18[x >> 18] &= ~(1ull << ((x >> 12) & 63))))
------------------
| Branch (21:11): [True: 0.00%, False: 0.00%]
------------------
22| 0| root &= ~(1ull << (x >> 18));
23| 199k|}
24| |
25| 200k|bool get(u32 x) { return leaf[x >> 6] & (1ull << (x & 63)); }
26| |
27| 200k|u32 nxt(u32 x) {
28| 200k| if (u64 tmp = leaf[x >> 6] & (-1ull << (x & 63)); !tmp) {
------------------
| Branch (28:53): [True: 1.51%, False: 98.49%]
------------------
29| 3.01k| if (u64 tmp = lv12[x >> 12] & (-2ull << ((x >> 6) & 63)); !tmp) {
------------------
| Branch (29:63): [True: 1.63%, False: 98.37%]
------------------
30| 49| if (u64 tmp = lv18[x >> 18] & (-2ull << ((x >> 12) & 63)); !tmp) {
------------------
| Branch (30:66): [True: 2.04%, False: 97.96%]
------------------
31| 1| if (u64 tmp = root & (-2ull << (x >> 18)); !tmp) {
------------------
| Branch (31:52): [True: 0.00%, False: 100.00%]
------------------
32| 0| return -1;
33| 1| } else {
34| 1| u32 ans = __builtin_ctzll(tmp);
35| 1| ans = ans << 6 | __builtin_ctzll(lv18[ans]);
36| 1| ans = ans << 6 | __builtin_ctzll(lv12[ans]);
37| 1| ans = ans << 6 | __builtin_ctzll(leaf[ans]);
38| 1| return ans;
39| 1| }
40| 48| } else {
41| 48| u32 ans = (x >> 18) << 6 | __builtin_ctzll(tmp);
42| 48| ans = ans << 6 | __builtin_ctzll(lv12[ans]);
43| 48| ans = ans << 6 | __builtin_ctzll(leaf[ans]);
44| 48| return ans;
45| 48| }
46| 2.96k| } else {
47| 2.96k| u32 ans = (x >> 12) << 6 | __builtin_ctzll(tmp);
48| 2.96k| ans = ans << 6 | __builtin_ctzll(leaf[ans]);
49| 2.96k| return ans;
50| 2.96k| }
51| 197k| } else {
52| 197k| u32 ans = (x >> 6) << 6 | __builtin_ctzll(tmp);
53| 197k| return ans;
54| 197k| }
55| 200k|}
56| |
57| 200k|u32 pre(u32 x) {
58| 200k| if (u64 tmp = leaf[x >> 6] & ~(-2ull << (x & 63)); !tmp) {
------------------
| Branch (58:54): [True: 1.59%, False: 98.41%]
------------------
59| 3.18k| if (u64 tmp = lv12[x >> 12] & ~(-1ull << ((x >> 6) & 63)); !tmp) {
------------------
| Branch (59:64): [True: 1.60%, False: 98.40%]
------------------
60| 51| if (u64 tmp = lv18[x >> 18] & ~(-1ull << ((x >> 12) & 63)); !tmp) {
------------------
| Branch (60:67): [True: 1.96%, False: 98.04%]
------------------
61| 1| if (u64 tmp = root & ~(-1ull << (x >> 18)); !tmp) {
------------------
| Branch (61:53): [True: 0.00%, False: 100.00%]
------------------
62| 0| return -1;
63| 1| } else {
64| 1| u32 ans = 63 - __builtin_clzll(tmp);
65| 1| ans = ans << 6 | 63 - __builtin_clzll(lv18[ans]);
66| 1| ans = ans << 6 | 63 - __builtin_clzll(lv12[ans]);
67| 1| ans = ans << 6 | 63 - __builtin_clzll(leaf[ans]);
68| 1| return ans;
69| 1| }
70| 50| } else {
71| 50| u32 ans = (x >> 18) << 6 | 63 - __builtin_clzll(tmp);
72| 50| ans = ans << 6 | 63 - __builtin_clzll(lv12[ans]);
73| 50| ans = ans << 6 | 63 - __builtin_clzll(leaf[ans]);
74| 50| return ans;
75| 50| }
76| 3.13k| } else {
77| 3.13k| u32 ans = (x >> 12) << 6 | 63 - __builtin_clzll(tmp);
78| 3.13k| ans = ans << 6 | 63 - __builtin_clzll(leaf[ans]);
79| 3.13k| return ans;
80| 3.13k| }
81| 197k| } else {
82| 197k| u32 ans = (x >> 6) << 6 | 63 - __builtin_clzll(tmp);
83| 197k| return ans;
84| 197k| }
85| 200k|}
86| |
87| |} // namespace
88| |
89| 1|int main() {
90| 1| rd rd;
91| 1| wt wt;
92| 1| int n = rd.uh();
93| 1| int q = rd.uh();
94| 1|#ifdef LOCAL
95| 1| root = 0;
96| 1| std::memset(lv18, 0, sizeof(lv18));
97| 1| std::memset(lv12, 0, sizeof(lv12));
98| 1| std::memset(leaf, 0, sizeof(leaf));
99| 1|#endif
100| 1| int i = 0;
101| 156k| for (; i + 64 < n; i += 64) {
^156k
------------------
| Branch (101:10): [True: 100.00%, False: 0.00%]
------------------
102| 156k| u32 a = _mm256_movemask_epi8(_mm256_cmpeq_epi8(
103| 156k| _mm256_loadu_si256(reinterpret_cast<const __m256i_u *>(rd.p + i)),
104| 156k| _mm256_set1_epi8('1')));
105| 156k| u32 b = _mm256_movemask_epi8(_mm256_cmpeq_epi8(
106| 156k| _mm256_loadu_si256(reinterpret_cast<const __m256i_u *>(rd.p + i + 32)),
107| 156k| _mm256_set1_epi8('1')));
108| 156k| leaf[i >> 6] = a | u64(b) << 32;
109| 156k| }
110| 65| for (; i < n; ++i) leaf[i >> 6] |= u64(rd.p[i] - '0') << (i & 63);
^64 ^64
------------------
| Branch (110:10): [True: 98.46%, False: 1.54%]
------------------
111| 156k| for (int i = 0; i <= (n - 1) / 64; ++i)
^156k
------------------
| Branch (111:19): [True: 100.00%, False: 0.00%]
------------------
112| 156k| lv12[i >> 6] |= u64(!!leaf[i]) << (i & 63);
113| 2.44k| for (int i = 0; i <= (n - 1) / 64 / 64; ++i)
^2.44k
------------------
| Branch (113:19): [True: 99.96%, False: 0.04%]
------------------
114| 2.44k| lv18[i >> 6] |= u64(!!lv12[i]) << (i & 63);
115| 40| for (int i = 0; i <= (n - 1) / 64 / 64 / 64; ++i)
^39
------------------
| Branch (115:19): [True: 97.50%, False: 2.50%]
------------------
116| 39| root |= u64(!!lv18[i]) << (i & 63);
117| 1| rd.p += n + 1;
118| 1.00M| while (q--) {
------------------
| Branch (118:10): [True: 100.00%, False: 0.00%]
------------------
119| 1.00M| let t = rd.u1();
120| 1.00M| let k = rd.uh();
121| 1.00M| if (t == 0) {
------------------
| Branch (121:9): [True: 19.92%, False: 80.08%]
------------------
122| 199k| set(k);
123| 199k| }
124| 1.00M| if (t == 1) {
------------------
| Branch (124:9): [True: 19.99%, False: 80.01%]
------------------
125| 199k| unset(k);
126| 199k| }
127| 1.00M| if (t == 2) {
------------------
| Branch (127:9): [True: 20.07%, False: 79.93%]
------------------
128| 200k| let x = get(k);
129| 200k| wt.uw(x);
130| 200k| }
131| 1.00M| if (t == 3) {
------------------
| Branch (131:9): [True: 20.00%, False: 80.00%]
------------------
132| 200k| let x = nxt(k);
133| 200k| if (~x) {
------------------
| Branch (133:11): [True: 100.00%, False: 0.00%]
------------------
134| 200k| wt.uw(x);
135| 200k| } else {
136| 0| wt.puts(" -1", 3);
137| 0| }
138| 200k| }
139| 1.00M| if (t == 4) {
------------------
| Branch (139:9): [True: 20.02%, False: 79.98%]
------------------
140| 200k| let x = pre(k);
141| 200k| if (~x) {
------------------
| Branch (141:11): [True: 100.00%, False: 0.00%]
------------------
142| 200k| wt.uw(x);
143| 200k| } else {
144| 0| wt.puts(" -1", 3);
145| 0| }
146| 200k| }
147| 1.00M| }
148| 1| return 0;
149| 1|}