Submission #993808

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
const long long MOD = 1000000007;
const int INF = 1<<29;
const double EPS = 1e-8;
typedef vector<int> vec;
typedef pair<int,int> P;
typedef long long ll;

ll best_score;
ll N, A;
map<ll, ll> memov;
map<ll, ll> memot;

void dfs(ll v, ll t){
    if(best_score <= t) return;

    if(memov.count(v) != 0 && memov[v] < t) return;
    if(memot.count(t) != 0 && memot[t] > v) return;
    memov[v] = t;
    memot[t] = v;

    ll score = t + (N + v - 1) / v;
    best_score = min(best_score, score);
    if(best_score <= t + 2 + A) return;

    for(ll k=2;;k++){
        dfs(k*v, t + k + A);
        if(k * v >= N) break;
    }
}

int main(){
    cin >> N >> A;
    best_score = N;
    memov.clear();
    memot.clear();
    dfs(1, 0);
    cout << best_score << endl;
    return 0;
}

Submission Info

Judge Result