Problem p02788 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...)                                                               \
  do {                                                                         \
    cerr << __LINE__ << ": ";                                                  \
    dbgprint(#__VA_ARGS__, __VA_ARGS__);                                       \
  } while (0);

using namespace std;

namespace std {
template <class S, class T> struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T> struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v)
      h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v)
    os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v)
    os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);

  int n;
  ll d, a;
  cin >> n >> d >> a;
  d *= 2;
  vector<ll> ps;
  vector<pair<ll, ll>> in;
  rep(i, n) {
    ll x, h;
    cin >> x >> h;
    x *= 2;
    in.emplace_back(x, h);
    ps.pb(x - d);
    ps.pb(x);
    ps.pb(x + d + 1);
  }
  sort(all(ps));
  ps.erase(unique(all(ps)), ps.end());

  vector<vector<ll>> ev(ps.size());
  rep(i, n) {
    ll x = in[i].first;
    x = lower_bound(all(ps), x - d) - ps.begin();
    ev[x].pb(i);
  }

  ll bomb = 0, ans = 0;
  rep(i, ev.size()) for (ll j : ev[i]) {
    if (j < 0)
      bomb += j;
    else {
      ll x = in[j].first, h = in[j].second;
      x = lower_bound(all(ps), x + 2 * d + 1) - ps.begin();
      if (h > bomb * a) {
        ll k = (h - bomb * a + a - 1) / a;
        ans += k;
        bomb += k;
        ev[x].pb(-k);
      }
    }
  }
  cout << ans << endl;

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...)                                                               \
  do {                                                                         \
    cerr << __LINE__ << ": ";                                                  \
    dbgprint(#__VA_ARGS__, __VA_ARGS__);                                       \
  } while (0);

using namespace std;

namespace std {
template <class S, class T> struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T> struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v)
      h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v)
    os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v)
    os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);

  int n;
  ll d, a;
  cin >> n >> d >> a;
  d *= 2;
  vector<ll> ps;
  vector<pair<ll, ll>> in;
  rep(i, n) {
    ll x, h;
    cin >> x >> h;
    x *= 2;
    in.emplace_back(x, h);
    ps.pb(x - d);
    ps.pb(x);
    ps.pb(x + d + 1);
  }
  sort(all(ps));
  ps.erase(unique(all(ps)), ps.end());

  vector<vector<ll>> ev(ps.size());
  rep(i, n) {
    ll x = in[i].first;
    x = lower_bound(all(ps), x - d) - ps.begin();
    ev[x].pb(i);
  }

  ll bomb = 0, ans = 0;
  rep(i, ev.size()) for (ll j : ev[i]) {
    if (j < 0)
      bomb += j;
    else {
      ll x = in[j].first, h = in[j].second;
      x = lower_bound(all(ps), x + d + 1) - ps.begin();
      if (h > bomb * a) {
        ll k = (h - bomb * a + a - 1) / a;
        ans += k;
        bomb += k;
        ev[x].pb(-k);
      }
    }
  }
  cout << ans << endl;

  return 0;
}