Submission #1832548


Source Code Expand

# include <bits/stdc++.h>

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

using namespace std;

const int N = 2e7+10;
const ll inf = 1e15+7;

ll n, m, ans;
ll dp[N];
vector <ll> v;

int main () {
    cin >> n >> m;
    if(m + 1 >= n) {
        cout << n << endl;
        return 0;
    }
    ll L = 1;
    ll R = m + 1;
    while(R - L > 1) {
        ll x1 = L + (R - L + 1) / 3;
        ll x2 = R - (R - L + 1) / 3;
        if(x1 + (n + (x1 - 1)) / x1 + m < x2 + (n + (x2 - 1)) / x2 + m)
            R = x2;
        else
            L = x1;
    }
    ans = n;
    for(ll i = max(1ll, L - 10); i <= min(n, R + 10); i++) {
        ans = min(ans, i + (n + (i - 1)) / i + m);
    }
    if(m <= 30000000) {
        for(ll i = m + 2; i < ans; i++) {

            if(dp[i - m - 1] == 0) dp[i - m - 1] = i - m - 1;
            if(v.empty() || dp[i - m - 1] > dp[v.back()])
                v.pb(i - m - 1);
            dp[i] = i;
            for(ll j = 0; j < sz(v); j++) {
                dp[i] = max(dp[i], dp[v[j]] * (i - m - v[j]));
            }
            if(dp[i] >= n) {
                cout << i << endl;
                return 0;
            }
            if(i + (n + (dp[i] - 1)) / dp[i] + m < ans) ans = i + (n + (dp[i] - 1)) / dp[i] + m;
            //cout << i << " " << dp[i] << endl;
        }
    }
    cout << ans << endl;
}
/**
1000000000000 1000000000
**/

Submission Info

Submission Time
Task E - Cookies
User vjudge1
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1489 Byte
Status WA
Exec Time 2103 ms
Memory 3320 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 500 / 500 0 / 500
Status
AC × 3
AC × 27
AC × 67
WA × 1
TLE × 4
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
dataset1 sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt
dataset2 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt, 02-17.txt, 02-18.txt, 02-19.txt, 02-20.txt, 02-21.txt, 02-22.txt, 02-23.txt, 02-24.txt, 02-25.txt, 02-26.txt, 02-27.txt, 02-28.txt, 02-29.txt, 02-30.txt, 02-31.txt, 02-32.txt, 02-33.txt, 02-34.txt, 02-35.txt, 02-36.txt, 02-37.txt, 02-38.txt, 02-39.txt, 02-40.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt AC 1 ms 256 KB
01-11.txt AC 1 ms 256 KB
01-12.txt AC 4 ms 2304 KB
01-13.txt AC 1 ms 256 KB
01-14.txt AC 1 ms 256 KB
01-15.txt AC 1 ms 256 KB
01-16.txt AC 1 ms 256 KB
01-17.txt AC 1 ms 256 KB
01-18.txt AC 1 ms 256 KB
01-19.txt AC 1 ms 256 KB
01-20.txt AC 1 ms 256 KB
01-21.txt AC 1 ms 256 KB
01-22.txt AC 1 ms 256 KB
01-23.txt AC 1 ms 256 KB
01-24.txt AC 1 ms 256 KB
01-25.txt AC 1 ms 256 KB
01-26.txt AC 1 ms 256 KB
02-01.txt AC 1 ms 256 KB
02-02.txt AC 1 ms 256 KB
02-03.txt AC 1 ms 256 KB
02-04.txt AC 1 ms 256 KB
02-05.txt AC 1 ms 256 KB
02-06.txt AC 1 ms 256 KB
02-07.txt AC 1 ms 256 KB
02-08.txt AC 1 ms 256 KB
02-09.txt AC 1 ms 256 KB
02-10.txt AC 1 ms 256 KB
02-11.txt AC 1 ms 256 KB
02-12.txt AC 1 ms 256 KB
02-13.txt AC 1 ms 256 KB
02-14.txt AC 1 ms 256 KB
02-15.txt AC 1 ms 256 KB
02-16.txt AC 2 ms 256 KB
02-17.txt AC 2 ms 256 KB
02-18.txt AC 3 ms 256 KB
02-19.txt AC 8 ms 384 KB
02-20.txt AC 60 ms 512 KB
02-21.txt TLE 2055 ms 1404 KB
02-22.txt TLE 2103 ms 3320 KB
02-23.txt WA 1 ms 256 KB
02-24.txt AC 1 ms 256 KB
02-25.txt AC 1 ms 256 KB
02-26.txt AC 1 ms 256 KB
02-27.txt AC 1 ms 256 KB
02-28.txt AC 1 ms 256 KB
02-29.txt AC 1 ms 256 KB
02-30.txt AC 1 ms 256 KB
02-31.txt AC 1 ms 256 KB
02-32.txt AC 1 ms 256 KB
02-33.txt AC 1 ms 256 KB
02-34.txt AC 1 ms 256 KB
02-35.txt AC 1 ms 256 KB
02-36.txt AC 1 ms 256 KB
02-37.txt AC 7 ms 384 KB
02-38.txt AC 121 ms 640 KB
02-39.txt TLE 2103 ms 3320 KB
02-40.txt TLE 2103 ms 3320 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB