Problem p02669 (C++) — buggy submission, verdict: Time Limit Exceeded

#pragma GCC target("avx")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL, LL>
#define VE vector
#define VL vector<LL>
#define VP vector<pair<LL, LL>>
#define VVL vector<vector<LL>>
#define PQ priority_queue
#define PQS priority_queue<LL, vector<LL>, greater<LL>>
#define PB push_back
#define POB pop_back
#define PF push_front
#define POF pop_front
#define EB emplace_back
#define MP make_pair
#define TS to_string
#define TU to_ullong
#define BPL __builtin_popcountll
#define FOR(i, a, n) for (i = a; i < n; ++i)
#define FORR(i, a, n) for (i = n - 1; i >= a; --i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) FORR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define UB(a, n) *upper_bound(ALL(a), n)
#define LB(a, n) *lower_bound(ALL(a), n)
#define INF 1145141919810364364LL
#define PI 3.14159265358979
// #define MOD 1000000007
#define MOD 998244353
#define ERR 0.00000001
#define FAST                                                                   \\
  cin.tie(0);                                                                  \\
  ios::sync_with_stdio(false)

void Yn(LL a) {
  if (a)
    printf("Yes\\n");
  else
    printf("No\\n");
}
void YN(LL a) {
  if (a)
    printf("YES\\n");
  else
    printf("NO\\n");
}
LL pwmn(LL a, LL n) {
  LL ans = 1;
  while (ans < a)
    ans *= n;
  return ans;
}
LL dig(LL n) {
  LL ret = 0;
  while (n)
    n /= 10, ret++;
  return ret;
}
LL LBn(VL &v, LL a) {
  LL mx = v.size(), mn = -1, md;
  while (mx - mn > 1) {
    md = (mx + mn) / 2;
    if (v[md] < a)
      mn = md;
    else
      mx = md;
  }
  return mx;
}
LL GCD(LL a, LL b) {
  LL c = 1, tmp = max(a, b);
  b = min(a, b);
  a = tmp;
  while (c != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
LL LCM(LL a, LL b) { return a * b / GCD(a, b); }
int lcmp(const void *a, const void *b) {
  if (*(LL *)a > *(LL *)b)
    return 1;
  if (*(LL *)a < *(LL *)b)
    return -1;
  return 0;
}
int lcmpr(const void *a, const void *b) {
  if (*(LL *)a > *(LL *)b)
    return -1;
  if (*(LL *)a < *(LL *)b)
    return 1;
  return 0;
}
int ccmp(const void *a, const void *b) { return *(char *)a - *(char *)b; }
int ccmpr(const void *a, const void *b) { return *(char *)b - *(char *)a; }
int scmp(const void *a, const void *b) { return strcmp((char *)a, (char *)b); }
int scmpr(const void *a, const void *b) { return strcmp((char *)b, (char *)a); }
LL cmod(LL a, LL m) {
  if (a % m < 0)
    return a % m + abs(m);
  else
    return a % m;
}
LL DIV(LL a, LL d, LL m) {
  LL l = m, x = 1, y = 0, k;
  while (l) {
    k = d / l;
    d -= k * l;
    swap(l, d);
    x -= k * y;
    swap(x, y);
  }
  return cmod(a * cmod(x, m), m);
}
LL POW(LL a, LL n, LL m) {
  LL ans = 1;
  while (n > 0) {
    if (n & 1)
      ans = ans * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return ans;
}
VL fact, finv, inv;
void comi(LL n) {
  LL i;
  fact.resize(max(2LL, n + 1));
  finv.resize(max(2LL, n + 1));
  inv.resize(max(2LL, n + 1));
  fact[0] = fact[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  FOR(i, 2, n + 1) {
    fact[i] = fact[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
LL com(LL n, LL k) {
  if (n < k || n < 0 || k < 0)
    return 0;
  return fact[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool cmps(pair<LL, LL> a, pair<LL, LL> b) {
  if (a.second != b.second)
    return a.second < b.second;
  return a.first < b.first;
}
template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

map<LL, LL> m;
LL N, A, B, C, D;
LL calc(LL n) {
  // cout<<n<<endl;
  if (m.count(n))
    return m[n];
  LL x = n / 2, y = n / 3, z = n / 5;
  VL v(7);
  v[0] = calc(x) + (n - x * 2) * D + A,
  v[1] = calc(x + 1) + ((x + 1) * 2 - n) * D + A;
  v[2] = calc(y) + (n - y * 3) * D + B,
  v[3] = calc(y + 1) + ((y + 1) * 3 - n) * D + B;
  v[4] = calc(z) + (n - z * 5) * D + C,
  v[5] = calc(z + 1) + ((z + 1) * 5 - n) * D + C;
  if (dig(n) + dig(D) > 18)
    v[6] = INF;
  else
    v[6] = n * D;
  // for(LL l:v)cout<<l<<" ";
  // cout<<endl;
  SORT(v);
  // cout<<n<<endl;
  return m[n] = v[0];
}

int main() {
  FAST;
  LL q, T;
  cin >> T;
  rep(q, T) {
    cin >> N >> A >> B >> C >> D;
    m.clear();
    m[0] = 0;
    m[1] = D;
    m[2] = min(D * 2, D + A);
    cout << calc(N) << endl;
  }
}


Error: TLE

Fixed submission:

#define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define FAST                                                                   \\
  cin.tie(0);                                                                  \\
  ios::sync_with_stdio(false)

using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;

map<LLONG, LLONG> num2MinCostMap;
LLONG costs[3];
LLONG ks[3];
LLONG N, D;

const LLONG DFS(const LLONG n) {
  if (num2MinCostMap.count(n))
    return num2MinCostMap[n];
  LLONG minCost = log10(n) * log10(D) < 18.0 ? n * D : 9e18;
  for (int i = 0; i < 3; ++i) {
    LLONG k = ks[i];
    LLONG lower = n / k;
    LLONG upper = lower + 1;
    minCost = min(minCost, min(DFS(lower) + costs[i] + (n - lower * k) * D,
                               DFS(upper) + costs[i] + (upper * k - n) * D));
  }
  return num2MinCostMap[n] = minCost;
}

void Solve() {
  cin >> N >> costs[0] >> costs[1] >> costs[2] >> D;
  num2MinCostMap.clear();
  num2MinCostMap[0] = 0;
  num2MinCostMap[1] = D;
  num2MinCostMap[2] = min(D * 2, D + costs[0]);
  ks[0] = 2, ks[1] = 3, ks[2] = 5;
  cout << DFS(N) << endl;
}

int main() {
  FAST;
  int T;
  cin >> T;
  for (int i = 0; i < T; ++T) {
    Solve();
  }
}