Submission #1832491

---

Source Code Expand

#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair

using namespace std;

long long n, k, ind = 0, ans;

int main()
{
    cin >> n >> k;
    ans = n;
    long long x = 1;
    int c = -1;
    while(ind <= n)
    {
        //cout << ind << " " << x << endl;
        if(ind == c)
            break;
        c = ind;
        ans = min(ans, (n + x - 1) / x + ind);
        long long l = ind + k + 1, r = (n - ind + x - 1) / x + ind + 3;
        while(r - l > 2)
        {
            long long mid1 = l + (r - l + 1) / 3, mid2 = l + (r - l + 1) / 3 * 2;
            if(mid1 + (n + x * (mid1 - k - ind) - 1) / (x * (mid1 - k - ind)) <= (n + x * (mid2 - k - ind) - 1) / (x * (mid2 - k - ind)) + mid2)
            {
                r = mid2;
            }else
            {
                l = mid1;
            }
        }
        long long mid1 = l, mid2 = r;
        long long h = x;
        if(mid1 + (n + x * (mid1 - k - ind) - 1) / (x * (mid1 - k - ind )) <= (n + x * (mid2 - k - ind) - 1) / (x * (mid2 - k - ind)) + mid2)
            h = x * (mid1 - k - c), ind = l;
        else
            h = x * (mid2 - k - c), ind = r;

        mid1 = ind, mid2 = r - 1;
        if(mid1 + (n + x * (mid1 - k - c) - 1) / (x * (mid1 - k - c)) <= (n + x * (mid2 - k - c) - 1) / (x * (mid2 - k - c)) + mid2)
            h = x * (mid1 - k - c), ind = mid1;
        else
            h = x * (mid2 - k - c), ind = mid2;

        x = h;
    }

    cout << ans;
    return 0;
}

Submission Info

Judge Result