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

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// [Tips]
// XCode??§???EOF??\\??????Ctrl+D
// ?\\???Alt+\\
// ans???????§?INT?????????2,147,483,647????¶????????????¨??????????????§long
// long?????£???????????????????????????
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

////////////////////////////////////////
// Range Search (kD Tree)
//
//????????§kD Tree????????´???????£????????????????????????¶????????¨???TLE
// http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2581718#2
//
//??£?§£????????????
////////////////////////////////////////

// #define debug
// //*******************************************************************************************************************************************
#ifdef debug
#include <chrono>
#endif

#include <algorithm> // next_permutation
#include <cmath>
#include <cstdio>
#include <cstring> //memcpy
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric> //accumulate
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
// #include <map>
// #include <unordered_map> //hash func.
#include <fstream>  //ifstream, ofstream
#include <iterator> //insert_iterator::inserter
#include <set>

// #define NDEBUG //If NDEBUG is defined before #include <cassert>, assert will
// be ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;

#define dout cout
// If u wanna output to a text file instead of standard output, plz define
// OUTPUTFILE. #define OUTPUTFILE "output.txt"
// //************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath                                                         \\
  "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/"      \\
  "output.txt"
#endif

#define din cin
// If u wanna input from a text file instead of standard input, plz define
// INPUTFROMTEXTFILE???. #define INPUTFILE "input.txt"
// //**************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scand(A) scanf("%d", &(A))
#define scans(A) scanf("%s", (A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define dispAll(A, n)                                                          \\
  dout << #A << " = ";                                                         \\
  rep(j, 0, (n)) { disP(A[j]); }                                               \\
  dout << endl
// #define dispAll(A,n) cout << #A << " = "; rep(j, 0, (n)) {cout << setw(3) <<
// A[j] << " ";} cout << endl

#define sign(x) ((x) > 0) - ((x) < 0) // x<0: -1, x=0: 0, x>0: +1
#define p(i) ((i) / 2)
#define l(i) ((i)*2)
#define r(i) ((i)*2 + 1)
#define sibling(i) (i ^ 1) // the other sibling of i (ex. 16^1 = 17, 17^1 = 16)
#define isRightChild(i) (i & 1)   // ex. 16&1 = 0, 17&1 = 1
#define isLeftChild(i) (!(i & 1)) // ex. 16&1 = 1, 17&1 = 0

int dx[] = {
    1, -1, 0, 0, 1,
    1, -1, -1}; //???????????????????????????????¨??????????????????????????????????
int dy[] = {0, 0, -1, 1, -1, 1, 1, -1};

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long ull;

const int INF = (1 << 31) - 1;
const ll INF_LL = (ll)9e18 - 1LL; // Be careful for overflow.
const ull INF_ULL = (ull)1e19 - 1ULL;
const int NONE = -1;
const ll MOD =
    (ll)1e9 + 7; //??§???????´???°?????£??¨??¨????????°????????????10???7??????

const int N_MAX = 500010; // num of vertex or element
const int M_MAX = 100010; // num of edge
const int DATA_MAX = 1010;

int N;
iii pointXorder[N_MAX];
iii pointYorder[N_MAX];

void init() {}

void display() {
#ifdef debug
  dout << "---------------------\\n";

  dout << "pointXorder = \\n";
  rep(i, 0, N) {
    dout << pointXorder[i].first.first << " ";
    dout << pointXorder[i].first.second << " ";
    dout << pointXorder[i].second << " ";
    dout << endl;
  }

  dout << "pointYorder = \\n";
  rep(i, 0, N) {
    dout << pointYorder[i].first.first << " ";
    dout << pointYorder[i].first.second << " ";
    dout << pointYorder[i].second << " ";
    dout << endl;
  }

#endif
}

int main() {

  // cin, cout????????????
  // ?????¨??????cin?????????????????¨??¨cin??§???scanf?????????????????¨??¨scanf??§??±?????????????????????
  cin.tie(0);                  // cin??¨cout??????????????????
  ios::sync_with_stdio(false); // iostream??¨stdio??????????????????

  // read input data
  scand(N);
  init();
  display();

  //------------------------------------------------------------------------------------------
#ifdef debug
  // start timer
  auto startTime = chrono::system_clock::now();
#endif
  //------------------------------------------------------------------------------------------

  int x1, y1, x2, y2;

  rep(i, 0, N) {
    scanf("%d %d", &x1, &y1);
    pointXorder[i] = make_pair(make_pair(x1, y1), i);
    pointYorder[i] = make_pair(make_pair(y1, x1), i);
  }
  sort(pointXorder, pointXorder + N);
  sort(pointYorder, pointYorder + N);

  display();

  int Q;
  scand(Q);
  set<int> ans;

  rep(i, 0, Q) {
    scanf("%d %d %d %d", &x1, &x2, &y1, &y2);

    ans.clear();

    int x_low = lower_bound(pointXorder, pointXorder + N,
                            make_pair(make_pair(x1, y1), 0)) -
                pointXorder;
    int x_high = upper_bound(pointXorder, pointXorder + N,
                             make_pair(make_pair(x2, y2), N)) -
                 pointXorder;
    int y_low = lower_bound(pointYorder, pointYorder + N,
                            make_pair(make_pair(y1, x1), 0)) -
                pointYorder;
    int y_high = upper_bound(pointYorder, pointYorder + N,
                             make_pair(make_pair(y2, x2), N)) -
                 pointYorder;
    int x_width = x_high - x_low;
    int y_width = y_high - y_low;

    if (x_width < y_width) {
      rep(i, x_low, x_high) {
        int y = pointXorder[i].first.second;
        if (y1 <= y and y <= y2)
          ans.insert(pointXorder[i].second);
      }
    } else {
      rep(i, y_low, y_high) {
        int x = pointYorder[i].first.second;
        if (x1 <= x and x <= x2)
          ans.insert(pointYorder[i].second);
      }
    }

#ifdef debug
    dout << "=== OUTPUT ===\\n";
#endif
    //        sort(ans.begin(), ans.end());
    //        rep(i,0,ans.size()) {
    //            dout << ans[i] << endl;
    //        }
    //        dout << endl;
    for (set<int>::iterator itr = ans.begin(); itr != ans.end(); itr++) {
      dout << *itr << endl;
    }
    dout << endl;
  }

  //------------------------------------------------------------------------------------------
#ifdef debug
  // stop timer
  auto endTime = chrono::system_clock::now();
  auto dur = endTime - startTime;
  auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
  dout << fixed << setprecision(4) << (double)msec / 1000 << " sec \\n";
#endif
  //------------------------------------------------------------------------------------------

#ifdef INPUTFILE
  inputfile.close();
#endif

#ifdef OUTPUTFILE
  outputfile.close();
  cout << "\\"" << OutputFilePath << "\\"" << endl;
#endif

  return 0;
}

Error: TLE

Fixed submission:

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// [Tips]
// XCode??§???EOF??\\??????Ctrl+D
// ?\\???Alt+\\
// ans???????§?INT?????????2,147,483,647????¶????????????¨??????????????§long
// long?????£???????????????????????????
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

////////////////////////////////////////
// Range Search (kD Tree)
//
//????????§kD Tree????????´???????£????????????????????????¶????????¨???TLE
// http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2581718#2
//
//??£?§£????????????
////////////////////////////////////////

// #define debug
// //*******************************************************************************************************************************************
#ifdef debug
#include <chrono>
#endif

#include <algorithm> // next_permutation
#include <cmath>
#include <cstdio>
#include <cstring> //memcpy
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric> //accumulate
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
// #include <map>
// #include <unordered_map> //hash func.
#include <fstream>  //ifstream, ofstream
#include <iterator> //insert_iterator::inserter
#include <set>

// #define NDEBUG //If NDEBUG is defined before #include <cassert>, assert will
// be ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;

#define dout cout
// If u wanna output to a text file instead of standard output, plz define
// OUTPUTFILE. #define OUTPUTFILE "output.txt"
// //************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath                                                         \\
  "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/"      \\
  "output.txt"
#endif

#define din cin
// If u wanna input from a text file instead of standard input, plz define
// INPUTFROMTEXTFILE???. #define INPUTFILE "input.txt"
// //**************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scand(A) scanf("%d", &(A))
#define scans(A) scanf("%s", (A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define dispAll(A, n)                                                          \\
  dout << #A << " = ";                                                         \\
  rep(j, 0, (n)) { disP(A[j]); }                                               \\
  dout << endl
// #define dispAll(A,n) cout << #A << " = "; rep(j, 0, (n)) {cout << setw(3) <<
// A[j] << " ";} cout << endl

#define sign(x) ((x) > 0) - ((x) < 0) // x<0: -1, x=0: 0, x>0: +1
#define p(i) ((i) / 2)
#define l(i) ((i)*2)
#define r(i) ((i)*2 + 1)
#define sibling(i) (i ^ 1) // the other sibling of i (ex. 16^1 = 17, 17^1 = 16)
#define isRightChild(i) (i & 1)   // ex. 16&1 = 0, 17&1 = 1
#define isLeftChild(i) (!(i & 1)) // ex. 16&1 = 1, 17&1 = 0

int dx[] = {
    1, -1, 0, 0, 1,
    1, -1, -1}; //???????????????????????????????¨??????????????????????????????????
int dy[] = {0, 0, -1, 1, -1, 1, 1, -1};

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long ull;

const int INF = (1 << 31) - 1;
const ll INF_LL = (ll)9e18 - 1LL; // Be careful for overflow.
const ull INF_ULL = (ull)1e19 - 1ULL;
const int NONE = -1;
const ll MOD =
    (ll)1e9 + 7; //??§???????´???°?????£??¨??¨????????°????????????10???7??????

const int N_MAX = 500010; // num of vertex or element
const int M_MAX = 100010; // num of edge
const int DATA_MAX = 1010;

int N;
iii pointXorder[N_MAX];
iii pointYorder[N_MAX];

void init() {}

void display() {
#ifdef debug
  dout << "---------------------\\n";

  dout << "pointXorder = \\n";
  rep(i, 0, N) {
    dout << pointXorder[i].first.first << " ";
    dout << pointXorder[i].first.second << " ";
    dout << pointXorder[i].second << " ";
    dout << endl;
  }

  dout << "pointYorder = \\n";
  rep(i, 0, N) {
    dout << pointYorder[i].first.first << " ";
    dout << pointYorder[i].first.second << " ";
    dout << pointYorder[i].second << " ";
    dout << endl;
  }

#endif
}

int main() {

  // cin, cout????????????
  // ?????¨??????cin?????????????????¨??¨cin??§???scanf?????????????????¨??¨scanf??§??±?????????????????????
  cin.tie(0);                  // cin??¨cout??????????????????
  ios::sync_with_stdio(false); // iostream??¨stdio??????????????????

  // read input data
  scand(N);
  init();
  display();

  //------------------------------------------------------------------------------------------
#ifdef debug
  // start timer
  auto startTime = chrono::system_clock::now();
#endif
  //------------------------------------------------------------------------------------------

  int x1, y1, x2, y2;

  rep(i, 0, N) {
    scanf("%d %d", &x1, &y1);
    pointXorder[i] = make_pair(make_pair(x1, y1), i);
    pointYorder[i] = make_pair(make_pair(y1, x1), i);
  }
  sort(pointXorder, pointXorder + N);
  sort(pointYorder, pointYorder + N);

  display();

  int Q;
  scand(Q);
  set<int> ans;

  rep(i, 0, Q) {
    scanf("%d %d %d %d", &x1, &x2, &y1, &y2);

    ans.clear();

    int x_low = lower_bound(pointXorder, pointXorder + N,
                            make_pair(make_pair(x1, y1), 0)) -
                pointXorder;
    int x_high = upper_bound(pointXorder, pointXorder + N,
                             make_pair(make_pair(x2, y2), N)) -
                 pointXorder;
    int y_low = lower_bound(pointYorder, pointYorder + N,
                            make_pair(make_pair(x1, y1), 0)) -
                pointYorder;
    int y_high = upper_bound(pointYorder, pointYorder + N,
                             make_pair(make_pair(x2, y2), N)) -
                 pointYorder;
    int x_width = x_high - x_low;
    int y_width = y_high - y_low;

    rep(i, x_low, x_high) {
      int y = pointXorder[i].first.second;
      if (y1 <= y and y <= y2)
        ans.insert(pointXorder[i].second);
    }

#ifdef debug
    dout << "=== OUTPUT ===\\n";
#endif
    //        sort(ans.begin(), ans.end());
    //        rep(i,0,ans.size()) {
    //            dout << ans[i] << endl;
    //        }
    //        dout << endl;
    for (set<int>::iterator itr = ans.begin(); itr != ans.end(); itr++) {
      dout << *itr << endl;
    }
    dout << endl;
  }

  //------------------------------------------------------------------------------------------
#ifdef debug
  // stop timer
  auto endTime = chrono::system_clock::now();
  auto dur = endTime - startTime;
  auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
  dout << fixed << setprecision(4) << (double)msec / 1000 << " sec \\n";
#endif
  //------------------------------------------------------------------------------------------

#ifdef INPUTFILE
  inputfile.close();
#endif

#ifdef OUTPUTFILE
  outputfile.close();
  cout << "\\"" << OutputFilePath << "\\"" << endl;
#endif

  return 0;
}