burek

#include <bits/stdc++.h>
using namespace std;
const int MN = 1e7+100;
int startV[MN];
int endV[MN];
int startH[MN];
int endH[MN];
int activeV[MN];
int activeH[MN];
int main() {
    int n;
    cin>>n;
    for(int i = 0; i < n; ++i) {
	vector<int> x(3);
	vector<int> y(3);
	for(int j = 0; j < 3; ++j) {
	    cin>>x[j]>>y[j];
	}
	sort(x.begin(), x.end());
	sort(y.begin(), y.end());
	if(y[0]+2 <= y[2]) {
	    startV[y[0]+1]++;
	    endV[y[2]-1]++;
	}
	if(x[0]+2 <= x[2]) {
	    startH[x[0]+1]++;
	    endH[x[2]-1]++;
	}
    }
    int sumV = 0;
    int sumH = 0;
    for(int i = 0; i < MN; ++i) {
	sumV += startV[i];
	sumH += startH[i];

	activeV[i] = sumV;
	activeH[i] += sumH;

	sumV -= endV[i];
	sumH -= endH[i];
    }
    int m;
    cin>>m;
    for(int i = 0; i < m; ++i) {
	char q, w;
	cin>>q>>w;
	int e;
	cin>>e;
	if(q == 'x') {
	    cout<<activeH[e]<<'\n';
	}
	else {
	    cout<<activeV[e]<<'\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