Submission #993624

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define repeat_from_reverse(i,m,n) for (int i = (n)-1; (i) >= (m); --(i))
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
typedef long long ll;
using namespace std;
template <class T> void setmax(T & a, T const & b) { if (a < b) a = b; }
template <class T> void setmin(T & a, T const & b) { if (b < a) a = b; }
template <typename T, typename X> auto vectors(T a, X x) { return vector<T>(x, a); }
template <typename T, typename X, typename Y, typename... Zs> auto vectors(T a, X x, Y y, Zs... zs) { auto cont = vectors(a, y, zs...); return vector<decltype(cont)>(x, cont); }
template <typename T> T input(istream & in) { T a; in >> a; return a; }
const int inf = 1e9+7;
int main() {
    ll n, a; cin >> n >> a;
    assert (n <= 1000000);
    assert (a <= 1000000);
    map<ll,ll> memo;
    memo[0] = 0;
    function<ll (ll)> go = [&](ll n) {
        if (memo.count(n)) return memo[n];
        ll t = n;
        if (a < n) {
            auto recur = [&](int x) { return x < n ? go(x) : x; };
            auto f = [&](int x) { return recur(x) + a + recur((n+x-1)/x); };
            repeat_from (x,2,n) {
                setmin(t, f(x));
                if (x-30 >= 10 and f(x-30) < f(x-30+1)) break;
            }
        }
        return memo[n] = t;
    };
    cout << go(n) << endl;
    return 0;
}

Submission Info

Judge Result