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

/**
 *    author:  otera
 **/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf = 1e9 + 7;
const ll INF = 3e18;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

int n, a, b, c, d;
map<int, int> mp;

int f(int x) {
  if (x == 0)
    return mp[0] = 0;
  if (x == 1)
    return mp[1] = d;
  if (mp[x] != 0)
    return mp[x];

  int res = INF;
  if ((ld)d * (ld)x < INF) {
    res = d * x;
  }
  if (f(x / 2) < INF)
    chmin(res, d * (x % 2) + a + f(x / 2));
  if (x / 2 + 1 < x && f(x / 2 + 1) < INF)
    chmin(res, d * (2 - x % 2) + a + f(x / 2 + 1));
  if (f(x / 3) < INF)
    chmin(res, d * (x % 3) + b + f(x / 3));
  if (x / 3 + 1 < x && f(x / 3 + 1) < INF)
    chmin(res, d * (3 - x % 3) + b + f(x / 3 + 1));
  if (f(x / 5) < INF)
    chmin(res, d * (x % 5) + c + f(x / 5));
  if (x / 5 + 1 < x && f(x / 5 + 1) < INF)
    chmin(res, d * (5 - x % 5) + c + f(x / 5 + 1));

  return mp[x] = res;
}

void solve() {
  cin >> n >> a >> b >> c >> d;
  cout << f(n) << endl;
  mp.clear();
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  // cout << fixed << setprecision(10);
  int t;
  cin >> t;
  rep(i, t) solve();
  // solve();
  return 0;
}

Error: -11

Fixed submission:

/**
 *    author:  otera
 **/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf = 1e9 + 7;
const ll INF = 3e18;
const ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

int n, a, b, c, d;

int f(int x, int q) {
  if (x == 0)
    return 0;
  int amari = x % q;
  int co;
  if (q == 2)
    co = a;
  else if (q == 3)
    co = b;
  else
    co = c;
  return min(amari * d + co + f(x / q, q),
             (q - amari) * d + co + f(x / q + 1, q));
}

void solve() {
  cin >> n >> a >> b >> c >> d;
  cout << min({f(n, 2), f(n, 3), f(n, 5)}) << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  // cout << fixed << setprecision(10);
  int t;
  cin >> t;
  rep(i, t) solve();
  // solve();
  return 0;
}