burek

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define LINF 999999999999999999LL
#define N (1<<17)
#define M 1000000007

using namespace std;

int vx[1000000];
int vy[1000000];

int main () {
  int n;
  cin>>n;
  for (int i = 0; i < n; i++) {
    int x1, y1, x2, y2, x3, y3;
    cin>>x1>>y1>>x2>>y2>>x3>>y3;
    int miy = min(min(y1, y2), y3);
    int may = max(max(y1, y2), y3);
    int mix = min(min(x1, x2), x3);
    int mx = max(max(x1, x2), x3);
    for (int x = mix + 1; x < mx; x++) vx[x]++;
    for (int y = miy + 1; y < may; y++) vy[y]++;
  }
  int q;
  cin>>q;
  for (int i = 0; i < q; i++) {
    char c, e;
    cin>>c>>e;
    int p;
    cin>>p;
    if (c == 'x') cout<<vx[p]<<endl;
    else cout<<vy[p]<<endl;
  }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED