Targeted advertising

input/code.cpp: In function 'int solve()':
input/code.cpp:174:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  174 |     for (int i = 1; i < tmp.size(); i++) {
      |                     ~~^~~~~~~~~~~~
input/code.cpp:207:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  207 |     for (int i = 0; i < res.size(); i++) {
      |                     ~~^~~~~~~~~~~~

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back

#define LSOne(S) ((S) & -(S))

using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()

template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}

typedef long long ll;
typedef long double ld;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;


struct Fenwick {
    vector<ll> tree;
    int n;

    Fenwick(int n) : n(n) {
        tree.assign(n, 0);
    }

    void point_add(int pos, ll val) {
        for (; pos < n; pos |= (pos + 1)) {
            tree[pos] += val;
        }
    }

    ll find_sum(int r) { // [0, r]
        ll ans = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1) {
            ans += tree[r];
        }
        return ans;
    }

    ll find_sum(int l, int r) { // [l, r)
        return find_sum(r - 1) - find_sum(l - 1);
    }
};

int solve() {
    int n, k, q; std::cin >> n >> k >> q;
    vector<int> v(n);
    std::map<int, vector<int>> mp;
    for (int i = 0; i < n; i++) {
        std::cin >> v[i];
        mp[v[i]].pb(i);
    }

    if(false)
    for(auto &w:mp) {
        std::cout << w.fi << ": ";
        __print(w.se); std::cout  << std::endl;
    }
    vector<pair<array<int, 3>, int>> Q;
    for (int i = 0; i < q; i++) {
        int l, r, x; std::cin >> l >> r >> x;
        Q.pb({{l, r, x}, i});
    }

    sort(Q.begin(), Q.end(), [&](auto &a, auto &b) {
        return a.fi[2]<b.fi[2];
    });

    //std::cout << Q.size() << std::endl;
    for (int i = 0; i < q; i++) {
        //__print(Q[i].fi); std::cout  << std::endl;
    }

    vector<int> tmp;
    tmp.pb(0);
    for (int i = 1; i < q; i++) {
        if(Q[i].fi[2]!=Q[i-1].fi[2]) {
            tmp.pb(i);
        }
    }

    tmp.pb(q);

    vector<int> res(q);
    for (int i = 0; i < q; i++) {
        //__print(Q[i].fi); std::cout  << std::endl;
        //std::cout << "Q: " << Q[i].se << std::endl;
    }

    //return 0;
    //std::cout  << std::endl;
    //std::cout << "tmp: ";
    //__print(tmp); std::cout  << std::endl;


    //return 0;
    //return 0;
    int curr=0;
    Fenwick ft(n);
    for (int i = 1; i < tmp.size(); i++) {
        //std::cout << Q[tmp[i-1]].fi[2] << std::endl;
        int currK=Q[tmp[i-1]].fi[2];
        //std::cout << "K: " << currK << std::endl;
        //__print(mp[currK]); std::cout  << std::endl;
        for(auto &w:mp[currK]) {
            ft.point_add(w, 1);
        }


        //for (int i = 0; i < n; i++) {
            //std::cout << ft.find_sum(i, i+1) << " ";
        //}
        //std::cout  << std::endl;
        
        for (int j = curr; j < tmp[i]; j++) {
            //std::cout << "lol" << std::endl;
            //std::cout << Q[j].fi[0] << " " << Q[j].fi[1] << std::endl;
            ll ans=ft.find_sum(Q[j].fi[0]-1, Q[j].fi[1]);

            //__print(Q[j].fi); std::cout  << std::endl;
            //std::cout << "lol" << std::endl;
            //std::cout  << Q[j].se << std::endl;
            res[Q[j].se]=ans;
        }
        //std::cout  << std::endl;
        for(auto &w:mp[currK]) {
            ft.point_add(w, -1);
        }

        curr=tmp[i];
    }

    for (int i = 0; i < res.size(); i++) {
        std::cout << res[i] << endl;
    }



     

    
    return 0;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }

        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

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: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED