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

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define fast_io                                                                \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define MOD (long long int)(1e9 + 7)
#define INF (int)(1e9)
#define LINF (long long int)(1e18)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

ll mpow(ll a, ll b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0) {
    ll memo = mpow(a, b / 2);
    return memo * memo % MOD;
  } else
    return mpow(a, b - 1) * a % MOD;
}
ll lpow(ll a, ll b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0) {
    ll memo = lpow(a, b / 2);
    return memo * memo;
  } else
    return lpow(a, b - 1) * a;
}
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n) {
  if (kaijo_memo.size() > n)
    return kaijo_memo[n];
  if (kaijo_memo.size() == 0)
    kaijo_memo.push_back(1);
  while (kaijo_memo.size() <= n)
    kaijo_memo.push_back(kaijo_memo[kaijo_memo.size() - 1] * kaijo_memo.size() %
                         MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n) {
  if (gyaku_kaijo_memo.size() > n)
    return gyaku_kaijo_memo[n];
  if (gyaku_kaijo_memo.size() == 0)
    gyaku_kaijo_memo.push_back(1);
  while (gyaku_kaijo_memo.size() <= n)
    gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size() - 1] *
                               mpow(gyaku_kaijo_memo.size(), MOD - 2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r) {
  if (n == r)
    return 1; // 0個の丸と-1個の棒みたいな時に時に効く？不安.
  if (n < r || r < 0)
    return 0;
  ll ret = 1;
  if (n <= 1e7) {
    ret *= kaijo(n);
    ret %= MOD;
    ret *= gyaku_kaijo(r);
    ret %= MOD;
    ret *= gyaku_kaijo(n - r);
    ret %= MOD;
  } else {
    rep(i, r) {
      ret *= n - i;
      ret %= MOD;
      ret *= mpow(r - i, MOD - 2);
      ret %= MOD;
    }
  }
  return ret;
}

int main(void) {
  fast_io cout << fixed << setprecision(15);
  int n, m;
  ll k;
  cin >> n >> m >> k;
  vector<ll> as(n), bs(m);
  rep(i, n) { cin >> as[i]; }
  ll t = 0;
  rep(i, m) {
    cin >> bs[i];
    t += bs[i];
  }
  int l = m;
  int ans = 0;
  rep(i, n + 1) {
    while (1) {
      if (k >= t || l == 0)
        break;
      else {
        l--;
        t -= bs[l];
      }
    }
    // cout << l <<endl;
    if (t > k)
      break;
    ans = max(ans, i + l);
    if (i == n)
      break;
    t += as[i];
  }
  cout << ans << endl;
  return 0;
}


Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

using namespace std;

#define fast_io                                                                \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define MOD (long long int)(1e9 + 7)
#define INF (int)(1e9)
#define LINF (long long int)(1e18)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

int main(int argc, char *argv[]) {
  int n, m;
  ll k;
  cin >> n >> m >> k;
  vector<ll> as(n), bs(m);
  rep(i, n) { cin >> as[i]; }
  rep(i, m) { cin >> bs[i]; }
  ll ta = 0;
  int a = 0;
  rep(i, m) {
    if (ta + as[i] > k) {
      break;
    }
    ta += as[i];
    a++;
  }
  ll t = 0;
  ll ts = k - ta;
  ll p = 0;
  ll ans = 0;
  // cout << ts << endl;
  rep(i, m) {
    if (t + bs[i] <= ts) {
      t += bs[i];
      p++;
    } else {
      break;
    }
    // cout << t << endl;
  }
  ans = a + p;
  /*cout << a << endl;
  cout << p << endl;
  cout << ans << endl;*/
  t = ts - t;
  // cout << t << endl;
  for (int i = a - 1; i >= 0; i--) {
    t += as[i];
    while (1) {
      if (t >= bs[p + 1]) {
        t -= bs[p + 1];
        p++;
      } else {
        break;
      }
      if (p == m) {
        break;
      }
    }
    ans = max(ans, i + p);
    // cout << t << " " << p << endl;
    if (p == m) {
      break;
    }
  }
  cout << ans << endl;

  return 0;
}