Problem p00730 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define maxch(x, y) x = max(x, y)
#define minch(x, y) x = min(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX / 3

#define MAX_N 1000

struct cake {
  int w, d, idx;
};

bool operator<(const cake &a, const cake &b) {
  if (a.idx == b.idx)
    return a.w * a.d < b.w * b.d;
  else
    return a.idx < b.idx;
}

int main() {
  cin.sync_with_stdio(false);
  while (1) {
    int n, W, D;
    cin >> n >> W >> D;
    if (W == 0)
      break;
    vector<cake> cs;
    cs.push_back((cake){W, D, -1});
    rep(q, n) {
      int p, s;
      cin >> p >> s;
      p--;
      cake nc = cs[p];
      cs.erase(cs.begin() + p);
      int w, d;
      w = nc.w;
      d = nc.d;
      s %= ((w + d) * 2);
      if (s < w || (s < w * 2 + d && s > w + d)) {
        if (s > w + d)
          s = 2 * w + d - s;
        cs.push_back((cake){s, d, q});
        cs.push_back((cake){w - s, d, q});
      } else {
        if (s > w * 2 + d)
          s = w * 2 + d * 2 - s;
        else
          s = s - w;
        cs.push_back((cake){w, s, q});
        cs.push_back((cake){w, d - s, q});
      }
      sort(all(cs));
    }
    vector<int> res;
    rep(i, cs.size()) {
      cake c = cs[i];
      res.pb(c.w * c.d);
    }
    sort(all(res));
    rep(i, res.size()) {
      printf("%d%c", res[i], i == res.size() - 1 ? '\\n' : ' ');
    }
  }
  return 0;
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define maxch(x, y) x = max(x, y)
#define minch(x, y) x = min(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX / 3

#define MAX_N 1000

struct cake {
  int x, y, w, d, idx;
};

bool operator<(const cake &a, const cake &b) {
  if (a.idx == b.idx)
    return a.w * a.d < b.w * b.d;
  else
    return a.idx < b.idx;
}

int n, W, D;

int main() {
  cin.sync_with_stdio(false);
  while (1) {
    cin >> n >> W >> D;
    if (W == 0)
      break;
    vector<cake> cs;
    cs.push_back((cake){0, 0, W, D, -1});
    rep(q, n) {
      int p, s;
      cin >> p >> s;
      p--;
      cake c = cs[p];
      cs.erase(cs.begin() + p);
      int w, d;
      w = c.w;
      d = c.d;
      s %= (w + d) * 2;
      if (s < w || (s < w * 2 + d && s > w + d)) {
        if (s > w)
          s = 2 * w + d - s;
        cs.push_back((cake){c.x, c.y, s, d, q});
        cs.push_back((cake){c.x + s, c.y, w - s, d, q});
      } else {
        if (s > w + d)
          s = w * 2 + d * 2 - s;
        cs.push_back((cake){c.x, c.y, w, s, q});
        cs.push_back((cake){c.x, c.y + s, w, d - s, q});
      }
      sort(all(cs));
    }
    vector<int> res;
    rep(i, cs.size()) {
      cake c = cs[i];
      res.pb(c.w * c.d);
    }
    sort(all(res));
    rep(i, res.size()) {
      printf("%d%c", res[i], i == res.size() - 1 ? '\\n' : ' ');
    }
  }
  return 0;
}