Submission #1832290

---

Source Code Expand

#include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define sz(s) ( (int)s.size() )
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 1e6 + 5;

int n, a, dp[N];

inline int min(int a, int b)
{
    return a < b ? a : b;
}

main ()
{
    cin >> n >> a;

    dp[1] = 1;

    for (int i = 2; i <= n; i++)
    {
        dp[i] = i;

        for (int j = 2; j * j <= i; j++)
            dp[i] = min( dp[i], dp[ (i + j - 1) / j ] + a + j );
    }
    cout << dp[n] << endl;
}

Submission Info

Judge Result