1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/*
 * @uni_kakurenbo
 * https://github.com/uni-kakurenbo/competitive-programming-workspace
 *
 * CC0 1.0  http://creativecommons.org/publicdomain/zero/1.0/deed.ja
 */
/* #language C++ 20 GCC */

#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"

#include <iostream><--- Include file:  not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include "snippet/aliases.hpp"
#include "snippet/fast_io.hpp"
#include "snippet/iterations.hpp"
#include "adaptor/io.hpp"
#include "adaptor/valarray.hpp"
#include "data_structure/fenwick_tree.hpp"
#include "data_structure/adaptor/set.hpp"

signed main() {
    uni::i32 n, q; input >> n >> q;
    uni::valarray<bool> t(n);<--- Shadowed declaration
    REP(i, n) {
        char v; input >> v;
        t[i] = v == '1';
    }
    uni::set_adaptor st(n);
    st.build_from_bits(t);

    REP(q) {
        uni::i32 t; input >> t;<--- Shadow variable
        if(t == 0) {
            uni::i32 k; input >> k;
            st.insert(k);
        }
        if(t == 1) {
            uni::i32 k; input >> k;
            st.remove(k);
        }
        if(t == 2) {
            uni::i32 k; input >> k;
            print(st.contains(k));
        }
        if(t == 3) {
            uni::i32 k; input >> k;
            print(st.next(k).value_or(-1));
        }
        if(t == 4) {
            uni::i32 k; input >> k;
            print(st.prev(k).value_or(-1));
        }
    }
}