Problem p02347 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
using namespace std;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));
#define rep(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define rrep(i, a, n) for (int i = (a), i##_len = (n); i > i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
constexpr int MAX = 1e6;
constexpr int NIL = -1;
struct Node {
  int location, p{NIL}, l{NIL}, r{NIL};
};
class Point {
public:
  int id, x, y;
  Point() : id(-1), x(0), y(0) {}
  Point(int id, int x, int y) : id(id), x(x), y(y) {}
  inline bool operator<(const Point &p) const { return id < p.id; }
};
Point P[MAX];
Node T[MAX];
int np{-1};
inline bool lessX(const Point &p1, const Point &p2) { return p1.x < p2.x; }
inline bool lessY(const Point &p1, const Point &p2) { return p1.y < p2.y; }
inline int makeKDTree(int l, int r, bool depth) {
  if (l >= r)
    return NIL;
  int mid = (l + r) / 2;
  int t = ++np;
  sort(P + l, P + r, (depth ? lessY : lessX));
  T[t].location = mid;
  T[t].l = makeKDTree(l, mid, !depth);
  T[t].r = makeKDTree(mid + 1, r, !depth);
  return t;
}
vi ans;
inline void find(int v, int &sx, int &tx, int &sy, int &ty, bool depth) {
  int x = P[T[v].location].x;
  int y = P[T[v].location].y;
  if (sx <= x && x <= tx && sy <= y && y <= ty) {
    ans.eb(P[T[v].location].id);
  }
  if (!depth) {
    if (T[v].l != NIL && sx <= x)
      find(T[v].l, sx, tx, sy, ty, !depth);
    if (T[v].r != NIL && x <= tx)
      find(T[v].r, sx, tx, sy, ty, !depth);
  } else {
    if (T[v].l != NIL && sy <= y)
      find(T[v].l, sx, tx, sy, ty, !depth);
    if (T[v].r != NIL && y <= ty)
      find(T[v].r, sx, tx, sy, ty, !depth);
  }
}
int main() {
  int N;
  scanf("%d", &N);
  int x, y;
  rep(i, 0, N) {
    scanf("%d %d", &x, &y);
    P[i] = Point(i, x, y);
  }
  int root = makeKDTree(0, N, 0);
  int q;
  cin >> q;
  int sx, tx, sy, ty;
  ans.reserve(MAX);
  rep(i, 0, q) {
    scanf("%d %d %d %d", &sx, &tx, &sy, &ty);
    ans.clear();
    find(root, sx, tx, sy, ty, 0);
    sort(all(ans));
    rep(j, 0, len(ans)) printf("%d\\n", ans[j]);
    printf("\\n");
  }
  return 0;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
struct cww {
  cww() {
    ios::sync_with_stdio(false);
    cin.tie(0);
  }
} star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));
#define rep(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define rrep(i, a, n) for (int i = (a), i##_len = (n); i > i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
constexpr int MAX = 1e6;
constexpr int NIL = -1;
struct Node {
  int location, p{NIL}, l{NIL}, r{NIL};
};
class Point {
public:
  int id, x, y;
  Point() : id(-1), x(0), y(0) {}
  Point(int id, int x, int y) : id(id), x(x), y(y) {}
  inline bool operator<(const Point &p) const { return id < p.id; }
};
Point P[MAX];
Node T[MAX];
int np{-1};
inline bool lessX(const Point &p1, const Point &p2) { return p1.x < p2.x; }
inline bool lessY(const Point &p1, const Point &p2) { return p1.y < p2.y; }
inline int makeKDTree(int l, int r, bool depth) {
  if (l >= r)
    return NIL;
  int mid = (l + r) / 2;
  int t = ++np;
  sort(P + l, P + r, (depth ? lessY : lessX));
  T[t].location = mid;
  T[t].l = makeKDTree(l, mid, !depth);
  T[t].r = makeKDTree(mid + 1, r, !depth);
  return t;
}
vi ans;
inline void find(int v, int &sx, int &tx, int &sy, int &ty, bool depth) {
  int x = P[T[v].location].x;
  int y = P[T[v].location].y;
  if (sx <= x && x <= tx && sy <= y && y <= ty) {
    ans.eb(P[T[v].location].id);
  }
  if (!depth) {
    if (T[v].l != NIL && sx <= x)
      find(T[v].l, sx, tx, sy, ty, !depth);
    if (T[v].r != NIL && x <= tx)
      find(T[v].r, sx, tx, sy, ty, !depth);
  } else {
    if (T[v].l != NIL && sy <= y)
      find(T[v].l, sx, tx, sy, ty, !depth);
    if (T[v].r != NIL && y <= ty)
      find(T[v].r, sx, tx, sy, ty, !depth);
  }
}
int main() {
  int N;
  cin >> N;
  int x, y;
  rep(i, 0, N) {
    cin >> x >> y;
    P[i] = Point(i, x, y);
  }
  int root = makeKDTree(0, N, 0);
  int q;
  cin >> q;
  int sx, tx, sy, ty;
  ans.reserve(MAX);
  int len_ans;
  rep(i, 0, q) {
    cin >> sx >> tx >> sy >> ty;
    ans.clear();
    find(root, sx, tx, sy, ty, 0);
    len_ans = len(ans);
    sort(all(ans));
    rep(j, 0, len_ans) P(ans[j]);
    cout << "\\n";
  }
  return 0;
}