Targeted advertising

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

struct Fenwick {
    int n;
    vector<long long> bit;

    Fenwick(int n = 0) { init(n); }

    void init(int n_) {
        n = n_;
        bit.assign(n + 1, 0);
    }

    void build(const vector<long long> &a) {
        n = (int) a.size();
        bit.assign(n + 1, 0);
        for (int i = 1; i <= n; ++i) {
            bit[i] += a[i - 1];
            int j = i + (i & -i);
            if (j <= n) bit[j] += bit[i];
        }
    }

    void build(const vector<int> &a) {
        n = (int) a.size();
        bit.assign(n + 1, 0);
        for (int i = 1; i <= n; ++i) {
            bit[i] += a[i - 1];
            int j = i + (i & -i);
            if (j <= n) bit[j] += bit[i];
        }
    }

    void add(int i, long long delta) {
        for (i += 1; i <= n; i += i & -i) bit[i] += delta;
    }

    // sum of [0..r]
    long long sumPrefix(int r) const {
        long long res = 0;
        for (int i = r + 1; i > 0; i -= i & -i) res += bit[i];
        return res;
    }

    // sum of [l..r] inclusive
    long long sumRange(int l, int r) const {
        if (r < l) return 0;
        return sumPrefix(r) - (l ? sumPrefix(l - 1) : 0);
    }
};


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    // freopen("input.txt", "r", stdin); // TODO: REMOVE THIS YOU STUPID ****

    int n, k, q;
    cin >> n >> k >> q;
    vector<Fenwick*> trees(n+1, nullptr);
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        if (trees[a] == nullptr) trees[a] = new Fenwick(n);
        trees[a]->add(i, 1);
    }

    for (int i = 0; i < q; i++) {
        int l,r,x;
        cin >> l >> r >> x;
        auto tree = trees[x];
        if (tree == nullptr) cout << 0 << endl;
        else {
            cout << tree->sumRange(l-1 ,r-1) << endl;
        }
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: RUNTIME ERROR

Test 61

Verdict: RUNTIME ERROR

Test 62

Verdict: RUNTIME ERROR

Test 63

Verdict: RUNTIME ERROR

Test 64

Verdict: RUNTIME ERROR

Test 65

Verdict: RUNTIME ERROR

Test 66

Verdict: RUNTIME ERROR

Test 67

Verdict: RUNTIME ERROR

Test 68

Verdict: RUNTIME ERROR

Test 69

Verdict: RUNTIME ERROR

Test 70

Verdict: ACCEPTED