caysoi.cpp

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

#define int long long
#define vi vector<int>
#define ii pair<int,int>
#define fi first
#define sc second
#define pb push_back
#define stoi stoll
#define popcnt __builtin_popcount
#define getbit(x, k) ((x >> k) & 1)
#define all(x) (x).begin(),(x).end()
#define FOR(i,j,k) for(int i=j; i<k; i++)
#define look(a) cerr <<#a<<": "<<a<<endl;
#define look2(a,b) cerr <<#a<<": "<<a<<" | "<<#b<<": "<<b<< endl;

map<int,vi> listx,listy;

void solve()
{
    int n;
    cin >> n;
    FOR(i,0,n){
        int x,y;
        cin >> x;
        cin >> y;
        listx[x].pb(y);
        listy[y].pb(x);
    }
    for (auto&itr:listx) sort(all(itr.sc));
    for (auto&itr:listy) sort(all(itr.sc));
    int p;
    cin >> p;
    FOR(i,0,p){
        int x1,y1,x2,y2;
        cin >> x1 >> y1 >> x2 >> y2;
        int ans = 0;
        ans += upper_bound(all(listx[x1]),y2-1) - lower_bound(all(listx[x1]),y1);
        ans += upper_bound(all(listx[x2]),y2) - lower_bound(all(listx[x2]),y1+1);
        ans += upper_bound(all(listy[y1]),x2) - lower_bound(all(listy[y1]),x1+1);
        ans += upper_bound(all(listy[y2]),x2-1) - lower_bound(all(listy[y2]),x1);
        cout << ans << '\n';
    }
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
        cout << '\n';
    }
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}