Problem p01540 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef ll li;
typedef pair<int, int> PI;
#define EPS (1e-6)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) rep(i, n)
#define F first
#define S second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define min3(a, b, c) min((a), min((b), (c)))
#define min4(a, b, c, d) min((a), min3((b), (c), (d)))
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(), a.end()
#define FLL(a, b) memset((a), b, sizeof(a))
#define CLR(a) memset((a), 0, sizeof(a))
#define FOR(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
template <typename T, typename U>
ostream &operator<<(ostream &out, const pair<T, U> &val) {
  return out << "(" << val.F << ", " << val.S << ")";
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &val) {
  out << "{";
  rep(i, SZ(val)) out << (i ? ", " : "") << val[i];
  return out << "}";
}
typedef double FP;
typedef complex<FP> pt;
typedef pt P;
typedef pair<pt, pt> line;
FP dot(P a, P b) { return real(conj(a) * b); }
FP crs(P a, P b) { return imag(conj(a) * b); }
P ortho(P a) { return conj(P(imag(a), real(a))); }
P ortho(line a) { return ortho(a.S - a.F); }
P crspt(P a, P b, P c, P d) {
  b -= a, d -= c;
  return a + b * crs(d, c - a) / crs(d, b);
}
P crspt(line a, line b) { return crspt(a.F, a.S, b.F, b.S); }
bool onl(P a1, P a2, P b) {
  return abs(b - a1) + abs(b - a2) < abs(a1 - a2) + EPS;
}
bool onl(line a, P b) { return onl(a.F, a.S, b); }
bool iscrs(line a, line b) {
  P c = crspt(a, b);
  return onl(a, c) && onl(b, c);
}
void pkuassert(bool t) { t = 1 / t; };
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[] = {1, 0, -1, 0, -1, 1, 1, -1};
enum { TOP, BTM, LFT, RGT, FRT, BCK };
int dxdy2ce[] = {RGT, FRT, LFT, BCK};
template <class T> T shift(T a, int b, int c, int d, int e) {
  __typeof(a[0]) t = a[b];
  a[b] = a[c];
  a[c] = a[d];
  a[d] = a[e];
  a[e] = t;
  return a;
}
template <class T> T rgt(T a) { return shift(a, TOP, LFT, BTM, RGT); }
template <class T> T lft(T a) { return shift(a, TOP, RGT, BTM, LFT); }
template <class T> T frt(T a) { return shift(a, TOP, BCK, BTM, FRT); }
template <class T> T bck(T a) { return shift(a, TOP, FRT, BTM, BCK); }
line mkl(P a, P v) { return line(a, a + v); }
FP lpdist(line a, P b) { return abs(b - crspt(a, mkl(b, ortho(a)))); }
FP spdist(line a, P b) {
  P c(crspt(a, mkl(b, ortho(a))));
  return onl(a, c) ? abs(b - c) : min(abs(a.F - b), abs(a.S - b));
}
FP ssdist(line a, line b) {
  return min4(spdist(a, b.F), spdist(a, b.S), spdist(b, a.F), spdist(b, a.S));
}

int n, m;
int sum[5100][5100];
int main(int argc, char *argv[]) {
  cin >> n >> m;
  vector<int> appx, appy;
  vector<PI> tr(n);
  rep(i, n) {
    cin >> tr[i].F >> tr[i].S;
    appx.pb(tr[i].F);
    appy.pb(tr[i].S);
  }
  sort(ALL(appx));
  sort(ALL(appy));
  appx.erase(unique(ALL(appx)), appx.end());
  appy.erase(unique(ALL(appy)), appy.end());
  map<int, int> xidx, yidx;
  rep(i, SZ(appx)) xidx[appx[i]] = i;
  rep(i, SZ(appy)) yidx[appy[i]] = i;

  FOR(it, tr)++ sum[xidx[it->F] + 1][yidx[it->S] + 1];
  rep(i, SZ(xidx) + 10) rep(j, SZ(yidx) + 10) sum[i + 1][j + 1] +=
      sum[i + 1][j] + sum[i][j + 1] - sum[i][j];

  rep(i, m) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1 = lower_bound(ALL(appx), x1) - appx.begin();
    x2 = lower_bound(ALL(appx), x2 + 1) - appx.begin();
    y1 = lower_bound(ALL(appy), y1) - appy.begin();
    y2 = lower_bound(ALL(appy), y2 + 1) - appy.begin();
    if (x1 > x2 || y1 > y2 || x2 > SZ(xidx) + 10 || y2 > SZ(yidx) + 10)
      break;
    cout << sum[x2][y2] + sum[x1][y1] - sum[x1][y2] - sum[x2][y1] << endl;
  }
}

Error: 0

Fixed submission:

#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef ll li;
typedef pair<int, int> PI;
#define EPS (1e-6)
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) rep(i, n)
#define F first
#define S second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define min3(a, b, c) min((a), min((b), (c)))
#define min4(a, b, c, d) min((a), min3((b), (c), (d)))
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(), a.end()
#define FLL(a, b) memset((a), b, sizeof(a))
#define CLR(a) memset((a), 0, sizeof(a))
#define FOR(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
template <typename T, typename U>
ostream &operator<<(ostream &out, const pair<T, U> &val) {
  return out << "(" << val.F << ", " << val.S << ")";
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &val) {
  out << "{";
  rep(i, SZ(val)) out << (i ? ", " : "") << val[i];
  return out << "}";
}
typedef double FP;
typedef complex<FP> pt;
typedef pt P;
typedef pair<pt, pt> line;
FP dot(P a, P b) { return real(conj(a) * b); }
FP crs(P a, P b) { return imag(conj(a) * b); }
P ortho(P a) { return conj(P(imag(a), real(a))); }
P ortho(line a) { return ortho(a.S - a.F); }
P crspt(P a, P b, P c, P d) {
  b -= a, d -= c;
  return a + b * crs(d, c - a) / crs(d, b);
}
P crspt(line a, line b) { return crspt(a.F, a.S, b.F, b.S); }
bool onl(P a1, P a2, P b) {
  return abs(b - a1) + abs(b - a2) < abs(a1 - a2) + EPS;
}
bool onl(line a, P b) { return onl(a.F, a.S, b); }
bool iscrs(line a, line b) {
  P c = crspt(a, b);
  return onl(a, c) && onl(b, c);
}
void pkuassert(bool t) { t = 1 / t; };
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[] = {1, 0, -1, 0, -1, 1, 1, -1};
enum { TOP, BTM, LFT, RGT, FRT, BCK };
int dxdy2ce[] = {RGT, FRT, LFT, BCK};
template <class T> T shift(T a, int b, int c, int d, int e) {
  __typeof(a[0]) t = a[b];
  a[b] = a[c];
  a[c] = a[d];
  a[d] = a[e];
  a[e] = t;
  return a;
}
template <class T> T rgt(T a) { return shift(a, TOP, LFT, BTM, RGT); }
template <class T> T lft(T a) { return shift(a, TOP, RGT, BTM, LFT); }
template <class T> T frt(T a) { return shift(a, TOP, BCK, BTM, FRT); }
template <class T> T bck(T a) { return shift(a, TOP, FRT, BTM, BCK); }
line mkl(P a, P v) { return line(a, a + v); }
FP lpdist(line a, P b) { return abs(b - crspt(a, mkl(b, ortho(a)))); }
FP spdist(line a, P b) {
  P c(crspt(a, mkl(b, ortho(a))));
  return onl(a, c) ? abs(b - c) : min(abs(a.F - b), abs(a.S - b));
}
FP ssdist(line a, line b) {
  return min4(spdist(a, b.F), spdist(a, b.S), spdist(b, a.F), spdist(b, a.S));
}

int n, m;

int main(int argc, char *argv[]) {
  cin >> n >> m;
  vector<int> appx, appy;
  vector<PI> tr(n);
  rep(i, n) {
    cin >> tr[i].F >> tr[i].S;
    appx.pb(tr[i].F);
    appy.pb(tr[i].S);
  }
  sort(ALL(appx));
  sort(ALL(appy));
  appx.erase(unique(ALL(appx)), appx.end());
  appy.erase(unique(ALL(appy)), appy.end());
  map<int, int> xidx, yidx;
  rep(i, SZ(appx)) xidx[appx[i]] = i;
  rep(i, SZ(appy)) yidx[appy[i]] = i;

  int sum[SZ(xidx) + 20][SZ(yidx) + 20];
  CLR(sum);
  FOR(it, tr)++ sum[xidx[it->F] + 1][yidx[it->S] + 1];
  rep(i, SZ(xidx) + 10) rep(j, SZ(yidx) + 10) sum[i + 1][j + 1] +=
      sum[i + 1][j] + sum[i][j + 1] - sum[i][j];

  rep(i, m) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1 = lower_bound(ALL(appx), x1) - appx.begin();
    x2 = lower_bound(ALL(appx), x2 + 1) - appx.begin();
    y1 = lower_bound(ALL(appy), y1) - appy.begin();
    y2 = lower_bound(ALL(appy), y2 + 1) - appy.begin();
    if (x1 > x2 || y1 > y2 || x2 > SZ(xidx) + 10 || y2 > SZ(yidx) + 10)
      break;
    cout << sum[x2][y2] + sum[x1][y1] - sum[x1][y2] - sum[x2][y1] << endl;
  }
}