Problem p02347 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;

class Node {
public:
  int p, location, l, r;
};

class Point {
public:
  int id;
  long x, y;

  Point() {}
  Point(int id, long x, long y) {
    this->id = id;
    this->x = x;
    this->y = y;
  }

  bool operator<(const Point &another) const { return id < another.id; }
};

const int MAX_N = 500000;

Node T[MAX_N];
Point P[MAX_N];

int N, NP = 0;
vector<Point> ANS;

bool compX(const Point &a, const Point &b) { return a.x < b.x; }

bool compY(const Point &a, const Point &b) { return a.y < b.y; }

int make1DTree(int l, int r, int d) {
  if (l >= r)
    return -1;

  int m = (l + r) / 2;
  int t = NP++;

  if (d % 2 == 0)
    sort(P + l, P + r, compX);
  else
    sort(P + l, P + r, compY);

  T[t].location = m;
  T[t].l = make1DTree(l, m, d + 1);
  T[t].r = make1DTree(m + 1, r, d + 1);

  return t;
}

void find(int v, long sx, long tx, long sy, long ty, int d) {
  long x = P[T[v].location].x;
  long y = P[T[v].location].y;

  if (sx <= x && x <= tx && sy <= y && y <= ty)
    ANS.push_back(P[T[v].location]);

  if (d % 2 == 0) {
    if (T[v].l != -1 && sx <= x)
      find(T[v].l, sx, tx, sy, ty, d + 1);

    if (T[v].r != -1 && x <= tx)
      find(T[v].r, sx, tx, sy, ty, d + 1);
  } else {
    if (T[v].l != -1 && sy <= y)
      find(T[v].l, sx, tx, sy, ty, d + 1);

    if (T[v].r != -1 && y <= ty)
      find(T[v].r, sx, tx, sy, ty, d + 1);
  }
}

int main() {
  cin >> N;

  for (int i = 0; i < N; i++) {
    long x, y;
    scanf("%ld %ld", &x, &y);
    // cin >> x >> y;
    Point p(i, x, y);
    P[i] = p;
    T[i].l = T[i].r = T[i].p = -1;
  }

  int root = make1DTree(0, N, 0);

  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    long sx, tx, sy, ty;
    scanf("%ld %ld %ld %ld", &sx, &tx, &sy, &ty);
    // cin >> sx >> tx >> sy >> ty;
    find(root, sx, tx, sy, ty, 0);
    sort(ANS.begin(), ANS.end());
    for (int j = 0; j < ANS.size(); j++)
      cout << ANS[j].id << endl;
    cout << endl;
    ANS.clear();
  }

  return 0;
}

Fixed submission:
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;

class Node {
public:
  int p, location, l, r;
};

class Point {
public:
  int id;
  long x, y;

  Point() {}
  Point(int id, long x, long y) {
    this->id = id;
    this->x = x;
    this->y = y;
  }

  bool operator<(const Point &another) const { return id < another.id; }
};

const int MAX_N = 500000;

Node T[MAX_N];
Point P[MAX_N];

int N, NP = 0;
vector<Point> ANS;

bool compX(const Point &a, const Point &b) { return a.x < b.x; }

bool compY(const Point &a, const Point &b) { return a.y < b.y; }

int make1DTree(int l, int r, int d) {
  if (l >= r)
    return -1;

  int m = (l + r) / 2;
  int t = NP++;

  if (d % 2 == 0)
    sort(P + l, P + r, compX);
  else
    sort(P + l, P + r, compY);

  T[t].location = m;
  T[t].l = make1DTree(l, m, d + 1);
  T[t].r = make1DTree(m + 1, r, d + 1);

  return t;
}

void find(int v, long sx, long tx, long sy, long ty, int d) {
  long x = P[T[v].location].x;
  long y = P[T[v].location].y;

  if (sx <= x && x <= tx && sy <= y && y <= ty)
    ANS.push_back(P[T[v].location]);

  if (d % 2 == 0) {
    if (T[v].l != -1 && sx <= x)
      find(T[v].l, sx, tx, sy, ty, d + 1);

    if (T[v].r != -1 && x <= tx)
      find(T[v].r, sx, tx, sy, ty, d + 1);
  } else {
    if (T[v].l != -1 && sy <= y)
      find(T[v].l, sx, tx, sy, ty, d + 1);

    if (T[v].r != -1 && y <= ty)
      find(T[v].r, sx, tx, sy, ty, d + 1);
  }
}

int main() {
  cin >> N;

  for (int i = 0; i < N; i++) {
    long x, y;
    scanf("%ld %ld", &x, &y);
    // cin >> x >> y;
    Point p(i, x, y);
    P[i] = p;
    T[i].l = T[i].r = T[i].p = -1;
  }

  int root = make1DTree(0, N, 0);

  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    long sx, tx, sy, ty;
    scanf("%ld %ld %ld %ld", &sx, &tx, &sy, &ty);
    // cin >> sx >> tx >> sy >> ty;
    find(root, sx, tx, sy, ty, 0);
    sort(ANS.begin(), ANS.end());
    for (int j = 0; j < ANS.size(); j++)
      printf("%d\n", ANS[j].id);
    // cout << ANS[j].id << endl;
    cout << endl;
    ANS.clear();
  }

  return 0;
}