Problem p01540 (C++) — buggy submission, verdict: Memory Limit Exceeded

#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
//    #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
//     #define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, pa>
#define ppap pair<pa, int>

#define ssa pair<string, int>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
using namespace std;
class pas {
public:
  int x, y, h;
  pas(int x = 0, int y = 0, int h = 0) : x(x), y(y), h(h) {}
  bool operator<(const pas &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pas &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  bool operator<(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
};

#define ppa pair<int, pas>
class Point {
public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
  }
};
typedef Point Vector;
#define pl pair<int, pas>
struct Segment {
  Point p1, p2;
};
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }

bool parareru(Point a, Point b, Point c, Point d) {
  //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
  return abs(cross(a - b, d - c)) < EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
  if (dot(b - a, c - a) < EPS)
    return (c - a).absv();
  if (dot(a - b, c - b) < EPS)
    return (c - b).absv();
  return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
    return false;
  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
    //		cout<<"sss"<<endl;
    if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)
      return true;
    if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)
      return true;
    if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)
      return true;
    if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)
      return true;
    return false;
  } else
    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
            EPS) &&
           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
            EPS);
}

double segment_dis(Segment a, Segment b) {
  if (is_intersected_ls(a, b))
    return 0;
  double r = distance_ls_p(a.p1, a.p2, b.p1);
  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
  return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2 - b.p1;
  double d1 = abs(cross(ba, a.p1 - b.p1));
  double d2 = abs(cross(ba, a.p2 - b.p1));
  double t = d1 / (d1 + d2);

  return a.p1 + (a.p2 - a.p1) * t;
}

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int gcd(int v, int b) {
  if (v > b)
    return gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return gcd(v, b % v);
}

double distans(double x1, double y1, double x2, double y2) {
  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return sqrt(rr);
}

//         int pr[2000010];
//       int inv[2000010];
/*
int beki(int wa,int rr,int warukazu){
    if(rr==0) return 1ll;
    if(rr==1) return wa%warukazu;
    if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
    int zx=beki(wa,rr/2,warukazu);
    return (zx*zx)%warukazu;
}

            int comb(int nn,int rr){
                    int r=pr[nn]*inv[rr];
                    r%=inf;
                    r*=inv[nn-rr];
                    r%=inf;
                    return r;
            }

void gya(int ert){
    pr[0]=1;
    for(int i=1;i<ert;i++){
            pr[i]=(pr[i-1]*i)%inf;
    }
    for(int i=0;i<ert;i++) inv[i]=beki(pr[i],inf-2,inf);

}
 */

// sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
// vector<double> ans(100000000),ans2(100000000);

int xx[5500], yy[5500];
int dp[6000][6000] = {0};
int dp2[6000][6000] = {0};
set<int> sex, sey;
map<int, int> maxx, may;
vector<int> vex, vey;
signed main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> xx[i] >> yy[i];
    sex.insert(xx[i]);
    sey.insert(yy[i]);
  }
  int cnt = 1;
  for (auto it = sex.begin(); it != sex.end(); it++) {
    maxx[*it] = cnt;

    cnt++;
    vex.pb(*it);
  }
  cnt = 1;
  for (auto it = sey.begin(); it != sey.end(); it++) {
    may[*it] = cnt;
    cnt++;
    vey.pb(*it);
  }
  for (int i = 0; i < n; i++) {
    dp[maxx[xx[i]]][may[yy[i]]]++;
    // 		cout<<maxx[xx[i]]<<" "<<may[yy[i]]<<endl;
  }

  for (int i = 1; i < 6000; i++)
    for (int j = 1; j < 6000; j++) {
      dp2[i][j] = dp2[i - 1][j] + dp2[i][j - 1] - dp2[i - 1][j - 1] + dp[i][j];
    }

  for (int i = 0; i < m; i++) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1--, y1--;

    auto itx1 = upper_bound(vex.begin(), vex.end(), x1) - vex.begin();
    auto itx2 = upper_bound(vex.begin(), vex.end(), x2) - vex.begin();
    auto ity1 = upper_bound(vey.begin(), vey.end(), y1) - vey.begin();
    auto ity2 = upper_bound(vey.begin(), vey.end(), y2) - vey.begin();

    //	cout<<itx1<<" "<<ity1<<" "<<itx2<<" "<<ity2<<endl;

    cout << dp2[itx2][ity2] - dp2[itx1][ity2] - dp2[itx2][ity1] +
                dp2[itx1][ity1]
         << endl;
  }
  return 0;
}


Error: MLE

Fixed submission:

#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
//    #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, pa>
#define ppap pair<pa, int>

#define ssa pair<string, int>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
using namespace std;
class pas {
public:
  int x, y, h;
  pas(int x = 0, int y = 0, int h = 0) : x(x), y(y), h(h) {}
  bool operator<(const pas &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pas &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  bool operator<(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
};

#define ppa pair<int, pas>
class Point {
public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
  }
};
typedef Point Vector;
#define pl pair<int, pas>
struct Segment {
  Point p1, p2;
};
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }

bool parareru(Point a, Point b, Point c, Point d) {
  //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
  return abs(cross(a - b, d - c)) < EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
  if (dot(b - a, c - a) < EPS)
    return (c - a).absv();
  if (dot(a - b, c - b) < EPS)
    return (c - b).absv();
  return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
    return false;
  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
    //		cout<<"sss"<<endl;
    if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)
      return true;
    if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)
      return true;
    if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)
      return true;
    if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)
      return true;
    return false;
  } else
    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
            EPS) &&
           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
            EPS);
}

double segment_dis(Segment a, Segment b) {
  if (is_intersected_ls(a, b))
    return 0;
  double r = distance_ls_p(a.p1, a.p2, b.p1);
  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
  return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2 - b.p1;
  double d1 = abs(cross(ba, a.p1 - b.p1));
  double d2 = abs(cross(ba, a.p2 - b.p1));
  double t = d1 / (d1 + d2);

  return a.p1 + (a.p2 - a.p1) * t;
}

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int gcd(int v, int b) {
  if (v > b)
    return gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return gcd(v, b % v);
}

double distans(double x1, double y1, double x2, double y2) {
  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return sqrt(rr);
}

//         int pr[2000010];
//       int inv[2000010];
/*
int beki(int wa,int rr,int warukazu){
    if(rr==0) return 1ll;
    if(rr==1) return wa%warukazu;
    if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
    int zx=beki(wa,rr/2,warukazu);
    return (zx*zx)%warukazu;
}

            int comb(int nn,int rr){
                    int r=pr[nn]*inv[rr];
                    r%=inf;
                    r*=inv[nn-rr];
                    r%=inf;
                    return r;
            }

void gya(int ert){
    pr[0]=1;
    for(int i=1;i<ert;i++){
            pr[i]=(pr[i-1]*i)%inf;
    }
    for(int i=0;i<ert;i++) inv[i]=beki(pr[i],inf-2,inf);

}
 */

// sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
// vector<double> ans(100000000),ans2(100000000);

int xx[5500], yy[5500];
int dp[6000][6000] = {0};
int dp2[6000][6000] = {0};
set<int> sex, sey;
map<int, int> maxx, may;
vector<int> vex, vey;
signed main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> xx[i] >> yy[i];
    sex.insert(xx[i]);
    sey.insert(yy[i]);
  }
  int cnt = 1;
  for (auto it = sex.begin(); it != sex.end(); it++) {
    maxx[*it] = cnt;

    cnt++;
    vex.pb(*it);
  }
  cnt = 1;
  for (auto it = sey.begin(); it != sey.end(); it++) {
    may[*it] = cnt;
    cnt++;
    vey.pb(*it);
  }
  for (int i = 0; i < n; i++) {
    dp[maxx[xx[i]]][may[yy[i]]]++;
    // 		cout<<maxx[xx[i]]<<" "<<may[yy[i]]<<endl;
  }

  for (int i = 1; i < 6000; i++)
    for (int j = 1; j < 6000; j++) {
      dp2[i][j] = dp2[i - 1][j] + dp2[i][j - 1] - dp2[i - 1][j - 1] + dp[i][j];
    }

  for (int i = 0; i < m; i++) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1--, y1--;

    auto itx1 = upper_bound(vex.begin(), vex.end(), x1) - vex.begin();
    auto itx2 = upper_bound(vex.begin(), vex.end(), x2) - vex.begin();
    auto ity1 = upper_bound(vey.begin(), vey.end(), y1) - vey.begin();
    auto ity2 = upper_bound(vey.begin(), vey.end(), y2) - vey.begin();

    //	cout<<itx1<<" "<<ity1<<" "<<itx2<<" "<<ity2<<endl;

    cout << dp2[itx2][ity2] - dp2[itx1][ity2] - dp2[itx2][ity1] +
                dp2[itx1][ity1]
         << endl;
  }
  return 0;
}