提出 #74605007

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define ll long long
const ll N = 1e6 + 5, MOD = 676767677, inf = 2e18;
using namespace std;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
char di[] = {'R', 'L', 'D', 'U'};
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

void Ebraam() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("Input.txt", "r", stdin);
    freopen("Output.txt", "w", stdout);
#endif
}

struct BIT {
    vector<int> bit;
    int n;

    BIT(int nn): n(nn) {
        bit.assign(n + 5, 0);
    }

    int get(int i) {
        int res = 0;
        for (; i; i -= i & -i)
            res += bit[i];
        return res;
    }

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

void solve() {
    int n, m, q, k;
    cin >> n >> m >> q >> k;
    vector<pair<int, int> > v(m);
    for (int i = 0; i < m; i++) {
        cin >> v[i].second >> v[i].first;
    }
    sort(v.rbegin(), v.rend());
    vector<array<int, 4> > vp(q);
    BIT bit(n);
    for (int i = 0; i < q; i++) {
        cin >> vp[i][0] >> vp[i][1] >> vp[i][2];
        vp[i][3] = i;
    }
    sort(vp.begin(), vp.end(), [&](auto &a, auto &b) {
        return a[2] > b[2];
    });
    vector<ll> ans(q, 0);
    int j = 0;
    for (auto [l,r,t,i]: vp) {
        while (j < m && v[j].first >= t) {
            bit.add(v[j].second, 1);
            j++;
        }
        ans[i] = max(bit.get(r) - bit.get(l - 1) - k, 0);
    }
    for (int i = 0; i < q; i++) {
        cout << ans[i] << "\n";
    }
}

int main() {
    Ebraam();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        if (t)cout << endl;
    }
    return 0;
}

提出情報

ジャッジ結果