P7424 天天爱射击

#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int N = 200005;

int n, m, cnt;
int ans[N], rootr[N], root[N];
struct tree {
    int L;
    int R;
    int cnt;
}t[N << 5];

struct wood {
    int l, r, kth;
}w[200005];

struct bullet {
    int x;
    int t;
    friend bool operator < (const bullet &a, const bullet &b) {
        if(a.x != b.x) return a.x < b.x;
        return a.t < b.t;
    }
}bu[200005];

int change(int pre, int l, int r, int x)
{
    int rt = ++cnt;
    t[rt] = t[pre];
    t[rt].cnt++;
    if(l == r) return rt;

    int mid = l + r >> 1;
    if(x > mid)
        t[rt].R = change(t[pre].R, mid + 1, r, x);
    if(x <= mid)
        t[rt].L = change(t[pre].L, l, mid, x);
    return rt;
}

int ask(int x, int y, int l, int r, int kth)
{
    if(l >= r) return l;
    int dta = t[t[y].L].cnt - t[t[x].L].cnt;
    int mid = l + r >> 1;
    if(dta < kth)
        return ask(t[x].R, t[y].R, mid + 1, r, kth - dta);
    else 
        return ask(t[x].L, t[y].L, l, mid, kth);
}


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n >> m;

    int l, r, kth, maxr = 0;
    for(int i = 1; i <= n; i++)
    {
        cin >> l >> r >> kth;
        w[i] = {l, r, kth};
        maxr = max(maxr, r);
    }

    int x;
    for(int i = 1; i <= m; i++)
    {
        cin >> x;
        bu[i] = {x, i};
    }
    sort(bu + 1, bu + m + 1);

    int pre = 0, rot;
    for(int i = 1; i <= m; i++) 
    {
        x = bu[i].x;
        root[x] = change(pre, 1, m, bu[i].t);
        pre = root[x];
        rootr[x] = x;
    }

    for(int i = 1; i <= maxr; i++) {
        if(!rootr[i]) rootr[i] = rootr[i - 1];
    }

    for(int i = 1; i <= n; i++)
    {
        auto[L, R, K] = w[i];
        L = rootr[L - 1];
        R = rootr[R];
        if(t[root[R]].cnt - t[root[L]].cnt < K) continue;
        ans[ask(root[L], root[R], 1, m, K)]++;
    }

    for(int i = 1; i <= m; i++)
    cout << ans[i] << '\n';

}