Submission #993485

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

const int INF = 1 << 30;

int N, A;
map< pair< int, int >, int > dp;

int rec(int cook, int now)
{
  if(cook >= N + N) return (INF);
  if(now >= N) return (0);
  if(dp.count(make_pair(cook, now))) return (dp[make_pair(cook, now)]);
  int ret = rec(cook, now + cook) + 1;
  if(now > cook) ret = min(ret, rec(now, 0) + A);
  return (dp[make_pair(cook, now)] = ret);
}

int main()
{
  cin >> N >> A;
  cout << rec(1, 1) + 1 << endl;
}

Submission Info

Judge Result