burek

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define F first
#define S second
pair<int,int> X[101010], Y[101010];
vector<pair<int,int>> Xq, Yq;
int V[101010];
int main(){
    int n, m;
    cin >> n;
    for(int i=0; i<n; ++i){
        int x, y;
        cin >> x >> y;
        X[i]={x, x};
        Y[i]={y, y};
        cin >> x >> y;
        X[i].F=min(X[i].F, x);
        X[i].S=max(X[i].S, x);
        Y[i].F=min(Y[i].F, y);
        Y[i].S=max(Y[i].S, y);
        cin >> x >> y;
        X[i].F=min(X[i].F, x);
        X[i].S=max(X[i].S, x);
        Y[i].F=min(Y[i].F, y);
        Y[i].S=max(Y[i].S, y);
    }
    sort(X, X+n);
    sort(Y, Y+n);
    cin >> m;

    for(int i=0; i<m; ++i){
        char a, b;
        int c;
        cin >> a >> b >> c;
        if(a=='x'){
            Xq.push_back({c, i});
        }else{
            Yq.push_back({c, i});
        }
    }
    sort(Xq.begin(), Xq.end());
    sort(Yq.begin(), Yq.end());
    priority_queue<int> q;
    int a=0;
    for(unsigned int i=0; i<Xq.size(); ++i){
        int c=Xq[i].F;

        while(a<n && X[a].F < c) {
            q.push(-X[a].S);
            ++a;
        }while(!q.empty() && -q.top() <=c){
            q.pop();
        }
        V[Xq[i].S]=q.size();

    }
    a=0;
    while(!q.empty()) q.pop();
    for(unsigned int i=0; i<Yq.size(); ++i){
        int c=Yq[i].F;
        while(a<n && Y[a].F < c) {
            q.push(-Y[a].S);
            ++a;
        }while(!q.empty() && -q.top() <=c){
            q.pop();
        }
        V[Yq[i].S]=q.size();

    }
    for(int i=0; i<m; ++i) cout << V[i] << "\n";


}

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