数据结构 二维偏序

园丁的烦恼

这个tuple真牛逼

#include <bits/stdc++.h>
using namespace std;

constexpr int MAXN = 1e7 + 5;
int sum[MAXN], ans[MAXN];
vector<pair<int, int>> vec;
vector<tuple<int, int, int, int>> q;

inline int lowbit(int x) { return x & (-x); }

void add(int pos, int x)
{
    for (; pos < MAXN; pos += lowbit(pos))
        sum[pos] += x;
}

int query_presum(int pos)
{
    int ans = 0;
    for (; pos > 0; pos -= lowbit(pos))
        ans += sum[pos];
    return ans;
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n, m, x1, x2, y1, y2;
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        cin >> x1 >> y1, ++x1, ++y1;
        vec.emplace_back(x1, y1);
    }
    sort(vec.begin(), vec.end());
    for (int i = 0; i < m; i++)
    {
        cin >> x1 >> y1 >> x2 >> y2;
        ++x1, ++y1, ++x2, ++y2;
        q.emplace_back(x1 - 1, y1 - 1, 1, i);
        q.emplace_back(x1 - 1, y2, -1, i);
        q.emplace_back(x2, y1 - 1, -1, i);
        q.emplace_back(x2, y2, 1, i);
    }
    sort(q.begin(), q.end());
    int cur = 0;
    for (auto [x, y, c, id] : q)
    {
        while (cur < n && vec[cur].first <= x)
            add(vec[cur].second, 1), ++cur;
        ans[id] += c * query_presum(y);
    }
    for (int i = 0; i < m; i++)
        cout << ans[i] << "\n";

    return 0;
}