Problem p02941 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007ll
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d)                                                         \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e)                                                      \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f)                                                   \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << endl
#define p7(a, b, c, d, e, f, g)                                                \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h)                                             \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i)                                          \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j)                                      \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v)                                                         \
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                                                             \
  idp {                                                                        \
    rep(i, n) { cout << x[i] << " "; }                                         \
    puts("");                                                                  \
  }
#define dump2(x, n)                                                            \
  idp {                                                                        \
    rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; }            \
    puts("");                                                                  \
  }
#define dumpi(x)                                                               \
  idp {                                                                        \
    foreach (it, x) {                                                          \
      cout << (*it) << " ";                                                    \
    }                                                                          \
    puts("");                                                                  \
  }
#define dumpi2(x)                                                              \
  idp {                                                                        \
    foreach (it, x) {                                                          \
      cout << "[" << (it)->F << " , " << (it)->S << "] ";                      \
    }                                                                          \
    puts("");                                                                  \
  }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                                                        \
  rep(i, h) {                                                                  \
    rep(j, w) cout << a[i][j] << " ";                                          \
    puts("");                                                                  \
  }

typedef pair<li, li> PI;

li a[200200];
li b[200200];
li n;
int main() {
  cin >> n;
  rin { cin >> a[i]; }
  rin { cin >> b[i]; }

  priority_queue<PI> pq;
  rin { pq.push({b[i], i}); }

  li res = 0;
  while (!pq.empty()) {
    li now = pq.top().S;
    li now_cost = pq.top().F;
    pq.pop();
    if (b[now] == a[now]) {
      continue;
    }
    if (b[now] < now_cost) {
      continue;
    }
    li next = (now + 1) % n;
    li prev = (now + n - 1) % n;
    li new_cost = b[now] - b[next] - b[prev];
    li top2 = pq.top().F;
    li diff = b[now] - max(top2, a[now]);
    li cnt = diff / (b[next] + b[prev]);
    cnt = max(cnt, 1ll);
    res += cnt;
    // dump(b, n);
    // p2(now, cnt);
    b[now] = b[now] - (b[next] + b[prev]) * cnt;
    if (b[now] < a[now]) {
      puts("-1");
      return 0;
    }
    pq.push({b[now], now});
  }
  cout << res << endl;

  return 0;
}


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

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007ll
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d)                                                         \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e)                                                      \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f)                                                   \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << endl
#define p7(a, b, c, d, e, f, g)                                                \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h)                                             \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i)                                          \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j)                                      \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v)                                                         \
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                                                             \
  idp {                                                                        \
    rep(i, n) { cout << x[i] << " "; }                                         \
    puts("");                                                                  \
  }
#define dump2(x, n)                                                            \
  idp {                                                                        \
    rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; }            \
    puts("");                                                                  \
  }
#define dumpi(x)                                                               \
  idp {                                                                        \
    foreach (it, x) {                                                          \
      cout << (*it) << " ";                                                    \
    }                                                                          \
    puts("");                                                                  \
  }
#define dumpi2(x)                                                              \
  idp {                                                                        \
    foreach (it, x) {                                                          \
      cout << "[" << (it)->F << " , " << (it)->S << "] ";                      \
    }                                                                          \
    puts("");                                                                  \
  }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                                                        \
  rep(i, h) {                                                                  \
    rep(j, w) cout << a[i][j] << " ";                                          \
    puts("");                                                                  \
  }

typedef pair<li, li> PI;

li a[200200];
li b[200200];
li n;
int main() {
  cin >> n;
  rin { cin >> a[i]; }
  rin { cin >> b[i]; }

  priority_queue<PI> pq;
  rin { pq.push({b[i], i}); }

  li res = 0;
  while (!pq.empty()) {
    li now = pq.top().S;
    li now_cost = pq.top().F;
    pq.pop();
    if (b[now] == a[now]) {
      continue;
    }
    if (b[now] < now_cost) {
      continue;
    }
    li next = (now + 1) % n;
    li prev = (now + n - 1) % n;
    li new_cost = b[now] - b[next] - b[prev];
    li top2 = pq.top().F;
    li diff = b[now] - max(a[now], a[now]);
    li cnt = diff / (b[next] + b[prev]);
    cnt = max(cnt, 1ll);
    res += cnt;
    // dump(b, n);
    // p2(now, cnt);
    b[now] = b[now] - (b[next] + b[prev]) * cnt;
    if (b[now] < a[now]) {
      puts("-1");
      return 0;
    }
    pq.push({b[now], now});
  }
  cout << res << endl;

  return 0;
}