burek

#include <bits/stdc++.h>
 
#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int
 
#define pii pair<int, int>
#define pll pair<long long, long long>
 
#define ld long double
#define defmod 1000000007
 
#define mati64(a,b) vector<vector<i64>>(a, vector<i64>(b, 0));
using namespace std;
const int p = 1<<20;
int ad[2<<20], ad2[2<<20];
 
void add(int i, int a, int b, int l, int r, int v){
  if(a >= r || b <= l)
    return;
  else if(a >= l && b <= r){
    ad[i]+=v;
    return;
  }
  int m = (a+b)/2;
  add(i*2, a, m, l, r, v);
  add(i*2+1, m, b, l, r, v);
}
void add2(int i, int a, int b, int l, int r, int v){
  if(a >= r || b <= l)
    return;
  else if(a >= l && b <= r){
    ad2[i]+=v;
    return;
  }
  int m = (a+b)/2;
  add2(i*2, a, m, l, r, v);
  add2(i*2+1, m, b, l, r, v);
}
int g1(int i){
  i+=p;
  int ans = 0;
  while(i){
    ans+=ad[i];
    i/=2;
  }
  return ans;
}
int g2(int i){
  i+=p;
  int ans = 0;
  while(i){
    ans+=ad2[i];
    i/=2;
  }
  return ans;
}
int main(){
  cin.sync_with_stdio(0);
  cin.tie(0);
 
  int n; cin >> n;
  int x[3][101010], y[3][101010];
  for(int i = 0; i < n; ++i){
    cin >> x[0][i] >> y[0][i] >> x[1][i] >> y[1][i] >> x[2][i] >> y[2][i];
    int mix = min(x[0][i], min(x[1][i], x[2][i])), mx = max(x[0][i], max(x[1][i], x[2][i]));
    int miy = min(y[0][i], min(y[1][i], y[2][i])), my = max(y[0][i], max(y[1][i], y[2][i]));
    add(1, 0, p, mix+1, mx, 1);
    add2(1, 0, p, miy+1, my, 1);
  }
  int m; cin >> m;
  while(m--){
    char lol; cin >> lol;
    if(lol == 'x'){
      int c; cin >> lol >> c;
      cout << g1(c) << endl;
    }
    else{
      int c; cin >> lol >> c;
      cout << g2(c) << endl;
    }
  }
  return 0;
}

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