burek

input/code.cpp: In function 'int main()':
input/code.cpp:55:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<xp.size(); ++i){
                           ^
input/code.cpp:60:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0; i<yp.size(); ++i){
                           ^

#include <iostream>
#include <set>
#include <vector>
#define MP make_pair
#define F first
#define S second
using namespace std;
int N, M;

set<int> xs;
int mx[1222333];
set<int> ys;
int my[1222333];

vector<pair<int, int> > xp;
vector<pair<int, int> > yp;

int stx[404040];

int sty[404040];

vector<pair<char, int> > cuts;

int main(){
  cin >> N;
  for (int i=0; i<N; ++i){
    int x1, y1, x2, y2, x3, y3;
    cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;
    int xn=min(x1, min(x2, x3));
    int xx=max(x1, max(x2, x3));
    int yn=min(y1, min(y2, y3));
    int yx=max(y1, max(y2, y3));
    xp.push_back(MP(xn, xx));
    yp.push_back(MP(yn, yx));
    xs.insert(xn);
    xs.insert(xx);
    ys.insert(yn);
    ys.insert(yx);
  }
  cin >> M;
  for (int i=0; i<M; ++i){
    char c, t;
    int p;
    cin >> c >> t >> p;
    cuts.push_back(MP(c, p));
    if (c=='y') ys.insert(p);
    else xs.insert(p);
  }
  
  int ii=0;
  for (auto a:xs) mx[a]=ii, ++ii;
  ii=0;
  for (auto a:ys) my[a]=ii, ++ii;
  
  for (int i=0; i<xp.size(); ++i){
    ++stx[mx[xp[i].F]+1];
    --stx[mx[xp[i].S]];
  }
  for (int i=1; i<404040; ++i) stx[i]+=stx[i-1];
  for (int i=0; i<yp.size(); ++i){
    ++sty[my[yp[i].F]+1];
    --sty[my[yp[i].S]];
  }
  for (int i=1; i<404040; ++i) sty[i]+=sty[i-1];
  for (int i=0; i<M; ++i){
    char c=cuts[i].F;
    int p=cuts[i].S;
    if (c=='y'){
      cout << sty[my[p]] << "\n";
    }else{
      cout << stx[mx[p]] << "\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: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED