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

#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())

const int MAX = 510000;
const int MOD = 1000000007;

map<ll, ll> m;
ll A, B, C, D;
ll solve(ll N) {
  if (N == 0)
    return 0;
  if (N == 1)
    return D;
  if (m.count(N))
    return m[N];

  m[N] = 1e18;
  if (N / 1e9 * D < 3e9)
    m[N] = min(m[N], N * D);

  m[N] = min(m[N], A + D * (N % 2) + solve(N / 2));
  m[N] = min(m[N], A + D * (2 - N % 2) + solve((N + 2) / 2));

  m[N] = min(m[N], B + D * (N % 3) + solve(N / 3));
  m[N] = min(m[N], B + D * (3 - N % 3) + solve((N + 3) / 3));

  m[N] = min(m[N], C + D * (N % 5) + solve(N / 5));
  m[N] = min(m[N], C + D * (5 - N % 5) + solve((N + 5) / 5));

  return m[N];
}

int main() {
  ll T;
  cin >> T;
  vector<ll> ans;
  rep(i, T) {
    ll N;
    cin >> N;
    cin >> A >> B >> C >> D;
    m.clear();
    ll tmp = solve(N);
    ans.pb(tmp);
  }
  rep(i, T) cout << ans[i] << endl;
}


Error: -11

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())

const int MAX = 510000;
const int MOD = 1000000007;

map<ll, ll> m;
ll A, B, C, D;
ll solve(ll N) {
  if (N == 0)
    return 0;
  if (N == 1)
    return D;
  // if(m.count(N)) return m[N];

  m[N] = 1e18;
  if (N / 1e9 * D < 3e9)
    m[N] = min(m[N], N * D);

  m[N] = min(m[N], A + D * (N % 2) + solve(N / 2));
  m[N] = min(m[N], A + D * (2 - N % 2) + solve((N + 2) / 2));

  m[N] = min(m[N], B + D * (N % 3) + solve(N / 3));
  m[N] = min(m[N], B + D * (3 - N % 3) + solve((N + 3) / 3));

  m[N] = min(m[N], C + D * (N % 5) + solve(N / 5));
  m[N] = min(m[N], C + D * (5 - N % 5) + solve((N + 5) / 5));

  return m[N];
}

int main() {
  ll T;
  cin >> T;
  vector<ll> ans;
  rep(i, T) {
    ll N;
    cin >> N;
    cin >> A >> B >> C >> D;
    m.clear();
    ll tmp = solve(N);
    ans.pb(tmp);
  }
  rep(i, T) cout << ans[i] << endl;
}