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

// g++ -std=c++17 -Wshadow -Wall -fsanitize=address -fsanitize=undefined
// -D_GLIBCXX_DEBUG -g PROGRAM -o OUTPUT -DLOCAL -lasan -lubsan
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define alli(a, n, k) (a + k), (a + n + k)
#define FP(i, a, b, k) for (__typeof(a) i = a; i < b; i += k)
#define FS(i, a, b, k) for (__typeof(a) i = a; i > b; i -= k)
#define IT(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define eps 1e-6
#define pi 3.141592653589793
using namespace std;
using namespace __gnu_pbds;

template <class T> inline T gcd(T x, T y) {
  if (!y)
    return x;
  return gcd(y, x % y);
}
typedef vector<int> VII;
typedef vector<ll> VLL;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> VPII;
typedef vector<pair<int, PII>> VPPI;
const int MOD = 1e9 + 7;
const int INF = 1e9;

inline ll modulo(ll a, ll m) { return (a % m + m) % m; }

inline ll modInverse(ll a, ll m) {
  assert(__gcd(a, m) == 1);
  ll m0 = m;
  ll y = 0, x = 1;

  if (m == 1)
    return 0;

  while (a > 1) {
    ll q = a / m;
    ll t = m;

    m = a % m, a = t;
    t = y;

    y = x - q * y;
    x = t;
  }

  if (x < 0)
    x += m0;

  return x;
}

inline ll modPow(ll x, ll y, ll m) { // x^y % m
  if (y == 0)
    return 1LL;
  else if (y == 1)
    return x;
  else {
    ll ans = modPow(x, y / 2, m) % m;
    if (y & 1) {
      return (((ans * ans) % m) * x) % m;
    } else {
      return (ans * ans) % m;
    }
  }
}

vector<string> split(char d, string s) {
  stringstream ss(s);
  string t;
  vector<string> words;
  while (getline(ss, t, d)) {
    words.pb(t);
  }

  return words;
}
// vector<vector<VII>> dp(1e4, vector<VII>(1e3, VII(81, -1)));
// int solve(VII &arr, int cash, int i, int stocks)
// {
//     if (i >= arr.size())
//         return cash;

//     if (dp[cash][stocks][i] != -1)
//         return dp[cash][stocks][i];
//     int b = arr[i];
//     int a1 = cash;

//     int bl = cash / b;
//     a1 = max(a1, solve(arr, cash - b * bl, i + 1, stocks + bl));

//     int b1 = cash;

//        b1 = max(b1, solve(arr, cash + (stocks * arr[i]), i + 1, 0));

//     int c1 = solve(arr, cash, i + 1, stocks);

//     return dp[cash][stocks][i] = max({a1, b1, c1});
// }
int main(int argc, char *argv[]) {
#ifdef LOCAL
  auto start = chrono::high_resolution_clock::now();
#endif

  ios::sync_with_stdio(false);
  cin.tie(NULL);

  int n;
  cin >> n;
  VII arr(n);
  for (auto &x : arr)
    cin >> x;

  ll money = 1000;
  for (int i = 0; i < n - 1; ++i) {
    ll s = money / arr[i];
    money += 1LL * s * max(arr[i + 1] - arr[i], 0);
  }

  cout << money;
  exit(0);

#ifdef LOCAL
  auto end = chrono::high_resolution_clock::now();
  double time_taken =
      chrono::duration_cast<chrono::nanoseconds>(end - start).count();

  time_taken *= 1e-9;

  cerr << "\\nTime taken by program is : " << fixed << time_taken
       << setprecision(9);
  cerr << " sec" << endl;
#endif
  return 0;
}


Error: -6
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc


Fixed submission:

// g++ -std=c++17 -Wshadow -Wall -fsanitize=address -fsanitize=undefined
// -D_GLIBCXX_DEBUG -g PROGRAM -o OUTPUT -DLOCAL -lasan -lubsan
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define alli(a, n, k) (a + k), (a + n + k)
#define FP(i, a, b, k) for (__typeof(a) i = a; i < b; i += k)
#define FS(i, a, b, k) for (__typeof(a) i = a; i > b; i -= k)
#define IT(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define eps 1e-6
#define pi 3.141592653589793
using namespace std;
using namespace __gnu_pbds;

template <class T> inline T gcd(T x, T y) {
  if (!y)
    return x;
  return gcd(y, x % y);
}
typedef vector<int> VII;
typedef vector<ll> VLL;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> VPII;
typedef vector<pair<int, PII>> VPPI;
const int MOD = 1e9 + 7;
const int INF = 1e9;

inline ll modulo(ll a, ll m) { return (a % m + m) % m; }

inline ll modInverse(ll a, ll m) {
  assert(__gcd(a, m) == 1);
  ll m0 = m;
  ll y = 0, x = 1;

  if (m == 1)
    return 0;

  while (a > 1) {
    ll q = a / m;
    ll t = m;

    m = a % m, a = t;
    t = y;

    y = x - q * y;
    x = t;
  }

  if (x < 0)
    x += m0;

  return x;
}

inline ll modPow(ll x, ll y, ll m) { // x^y % m
  if (y == 0)
    return 1LL;
  else if (y == 1)
    return x;
  else {
    ll ans = modPow(x, y / 2, m) % m;
    if (y & 1) {
      return (((ans * ans) % m) * x) % m;
    } else {
      return (ans * ans) % m;
    }
  }
}

vector<string> split(char d, string s) {
  stringstream ss(s);
  string t;
  vector<string> words;
  while (getline(ss, t, d)) {
    words.pb(t);
  }

  return words;
}
vector<vector<VII>> dp(1e4, vector<VII>(1e2, VII(81, -1)));
int solve(VII &arr, int cash, int i, int stocks) {
  if (i >= arr.size())
    return cash;

  if (dp[cash][stocks][i] != -1)
    return dp[cash][stocks][i];
  int b = arr[i];
  int a1 = cash;

  int bl = cash / b;
  a1 = max(a1, solve(arr, cash - b * bl, i + 1, stocks + bl));

  int b1 = cash;

  b1 = max(b1, solve(arr, cash + (stocks * arr[i]), i + 1, 0));

  int c1 = solve(arr, cash, i + 1, stocks);

  return dp[cash][stocks][i] = max({a1, b1, c1});
}
int main(int argc, char *argv[]) {
#ifdef LOCAL
  auto start = chrono::high_resolution_clock::now();
#endif

  ios::sync_with_stdio(false);
  cin.tie(NULL);

  int n;
  cin >> n;
  VII arr(n);
  for (auto &x : arr)
    cin >> x;

  cout << solve(arr, 1000, 0, 0);
  exit(0);

#ifdef LOCAL
  auto end = chrono::high_resolution_clock::now();
  double time_taken =
      chrono::duration_cast<chrono::nanoseconds>(end - start).count();

  time_taken *= 1e-9;

  cerr << "\\nTime taken by program is : " << fixed << time_taken
       << setprecision(9);
  cerr << " sec" << endl;
#endif
  return 0;
}