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
54
55
56
57
58
59
60
61
62
63
/*
 * @uni_kakurenbo
 * https://github.com/uni-kakurenbo/competitive-programming-workspace
 *
 * CC0 1.0  http://creativecommons.org/publicdomain/zero/1.0/deed.ja
 */
/* #language C++ GCC */

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"

#include "sneaky/enforce_int128_enable.hpp"

#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/set.hpp"
#include "data_structure/dynamic_set.hpp"
#include "data_structure/treap.hpp"
#include "action/null.hpp"
#include "random/engine.hpp"
#include "utility/timer.hpp"

signed main() {
    print("Hello World");

    uni::dynamic_set<uni::i64> data;
    uni::multiset<uni::i64> corr;

    debug(data);

    uni::timer timer(10000);

    while(!timer.expired()) {
        uni::i32 t = uni::randi64() % 2;
        uni::i64 v = (uni::randi64() % 2) || data.empty() ? uni::randi64() : data[uni::randi64() % data.size()].val();<--- Shadowed declaration
        debug(t, v);

        if(t == 0) {
            corr.insert(v);
            data.insert(v);
        }

        if(t == 1) {
            corr.remove(v);
            data.erase(v);
        }

        debug(corr, data);

        bool ok = true;
        {
            uni::i32 i = 0;
            ITR(v, corr) {<--- Shadow variable
                ok &= data[i++].val() == v;
            }
        }
        if(!ok) {
            assert(false);
        }
    }
}