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

#include <algorithm>     //sort,二分探索,など
#include <bitset>        //固定長bit集合
#include <cmath>         //pow,logなど
#include <complex>       //複素数
#include <deque>         //両端アクセスのキュー
#include <functional>    //sortのgreater
#include <iomanip>       //setprecision(浮動小数点の出力の誤差)
#include <iostream>      //入出力
#include <iterator>      //集合演算(積集合,和集合,差集合など)
#include <map>           //map(辞書)
#include <numeric>       //iota(整数列の生成),gcdとlcm(c++17)
#include <queue>         //キュー
#include <set>           //集合
#include <stack>         //スタック
#include <string>        //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility>       //pair
#include <vector>        //可変長配列

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define erep(i, n) for (int i = 0; i <= (n); ++i)
#define brep(i, n) for (int i = n; i >= 0; i--)
#define PI 3.14159265359
using namespace std;
using P = pair<int, int>;
using ll = long long;
using Graph = vector<vector<int>>;
const int INF = 100005;
const int MAX_K = 55;
const int MAX_W = 200005;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];

// ユークリッド互除法
unsigned gcd(unsigned a, unsigned b) {
  while (1) {
    if (a < b)
      swap(a, b);
    if (!b)
      break;
    a %= b;
  }
  return a;
}

// テーブルを作る前処理
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

// 二項係数計算
long long COM(int n, int k) {
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

/*
int main() {
    // 前処理
    COMinit();

    // 計算例
    cout << COM(100000, 50000) << endl;
}
*/

struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += MOD - a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime MOD
  mint inv() const { return pow(MOD - 2); }
  mint &operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }

const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};

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

ll solve(ll n) {
  if (n == 0)
    return 0;
  if (mp.count(n))
    return mp[n];
  ll ans = 1e18;
  if (n <= 3e9)
    ans = n * d;

  for (int p = -1; p <= 1; p++) {
    ll x = n + p;
    if (x % 2 != 0 || x < 0)
      continue;
    ll y = x / 2;
    if (y < n)
      ans = min(ans, abs(p) * d + a + solve(y));
  }
  for (int p = -2; p <= 2; p++) {
    ll x = n + p;
    if (x % 3 != 0 || x < 0)
      continue;
    ll y = x / 3;
    if (y < n)
      ans = min(ans, abs(p) * d + b + solve(y));
  }
  for (int p = -4; p <= 4; p++) {
    ll x = n + p;
    if (x % 5 != 0 || x < 0)
      continue;
    ll y = x / 5;
    if (y < n)
      ans = min(ans, abs(p) * d + c + solve(y));
  }

  return mp[n] = ans;
}

int main() {
  int t;
  cin >> t;
  rep(i, t) {
    mp.clear();
    cin >> n >> a >> b >> c >> d;
    cout << solve(n) << endl;
  }
}

Error: TLE

Fixed submission:

#include <algorithm>     //sort,二分探索,など
#include <bitset>        //固定長bit集合
#include <cmath>         //pow,logなど
#include <complex>       //複素数
#include <deque>         //両端アクセスのキュー
#include <functional>    //sortのgreater
#include <iomanip>       //setprecision(浮動小数点の出力の誤差)
#include <iostream>      //入出力
#include <iterator>      //集合演算(積集合,和集合,差集合など)
#include <map>           //map(辞書)
#include <numeric>       //iota(整数列の生成),gcdとlcm(c++17)
#include <queue>         //キュー
#include <set>           //集合
#include <stack>         //スタック
#include <string>        //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility>       //pair
#include <vector>        //可変長配列

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define erep(i, n) for (int i = 0; i <= (n); ++i)
#define brep(i, n) for (int i = n; i >= 0; i--)
#define PI 3.14159265359
using namespace std;
using P = pair<int, int>;
using ll = long long;
using Graph = vector<vector<int>>;
const int INF = 100005;
const int MAX_K = 55;
const int MAX_W = 200005;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];

// ユークリッド互除法
unsigned gcd(unsigned a, unsigned b) {
  while (1) {
    if (a < b)
      swap(a, b);
    if (!b)
      break;
    a %= b;
  }
  return a;
}

// テーブルを作る前処理
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

// 二項係数計算
long long COM(int n, int k) {
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

/*
int main() {
    // 前処理
    COMinit();

    // 計算例
    cout << COM(100000, 50000) << endl;
}
*/

struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += MOD - a.x) >= MOD)
      x -= MOD;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime MOD
  mint inv() const { return pow(MOD - 2); }
  mint &operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }

const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};

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

ll solve(ll n) {
  if (n == 0)
    return 0;
  if (n == 1)
    return d;
  ll ans = 1e18;
  if (n <= 1e9)
    ans = n * d;

  for (int p = -1; p <= 1; p++) {
    ll x = n + p;
    if (x % 2 != 0)
      continue;
    ll y = x / 2;
    ans = min(ans, abs(p) * d + a + solve(y));
  }
  for (int p = -2; p <= 2; p++) {
    ll x = n + p;
    if (x % 3 != 0)
      continue;
    ll y = x / 3;
    ans = min(ans, abs(p) * d + b + solve(y));
  }
  for (int p = -4; p <= 4; p++) {
    ll x = n + p;
    if (x % 5 != 0)
      continue;
    ll y = x / 5;
    ans = min(ans, abs(p) * d + c + solve(y));
  }

  return mp[n] = ans;
}

int main() {
  int t;
  cin >> t;
  rep(i, t) {
    mp.clear();
    cin >> n >> a >> b >> c >> d;
    cout << solve(n) << endl;
  }
}