Submission #1801617
Source Code Expand
#include<cstdio> #include<cstdlib> #include<cmath> #include<climits> #include<iostream> #include<string> #include<stack> #include<queue> #include<vector> #include<map> #include<set> #include<algorithm> #include<numeric> #define rep(n) for(int i=0;i<n;i++) #define repp(j, n) for(int j=0;j<n;j++) #define reppp(i, m, n) for(int i=m;i<=n;i++) #define all(c) c.begin(), c.end() #define rall(c) c.rbegin(), c.rend() #define MOD 1000000007 #define MAX 1000000001 #define INF 1410065408 #define EPS 1e-9 #define DEBUG 0 #define ll long long #define Pll pair<ll, ll> #define Pii pair<int, int> using namespace std; struct edge{int from, to; ll cost;}; ll mypow(ll p, ll n){ ll ret = 1; rep(n){ ret *= p; if(LLONG_MAX / p <= ret){ return LLONG_MAX; } } return ret; } signed main(){ ll N, A; cin >> N >> A; if(N<=3){ cout << N << endl; return 0; } ll ans = N; reppp(k, 1, 20){ ll ok = 10e12; ll ng = 1; while(abs(ok-ng) > 1){ ll mid = (ok+ng)/2; ll tmp = mypow(mid, (ll)(k+1)); if(tmp >= N || tmp == LLONG_MAX){ ok = mid; }else{ ng = mid; } } ll s1_num = 0; while(s1_num <= k && pow(ok-1, s1_num) * pow(ok, k+1-s1_num) >= N) s1_num++; if(s1_num < k+1 || pow(ok-1, s1_num) * pow(ok, k+1-s1_num) < N) s1_num--; //cout << k << " " << ok << " " << s1_num << endl; ans = min(ans, A*k + (ok-1)*s1_num + ok*(k+1-s1_num)); //cout << A*k + (ok-1)*s1_num + ok*(k+1-s1_num) << endl; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | Noimin |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1757 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | 0 / 500 | ||||||||
Status |
|
|
|
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 | 1 ms | 256 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 | WA | 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 | 1 ms | 256 KB |
02-17.txt | AC | 1 ms | 256 KB |
02-18.txt | AC | 1 ms | 256 KB |
02-19.txt | AC | 1 ms | 256 KB |
02-20.txt | AC | 1 ms | 256 KB |
02-21.txt | AC | 1 ms | 256 KB |
02-22.txt | AC | 1 ms | 256 KB |
02-23.txt | AC | 1 ms | 256 KB |
02-24.txt | AC | 1 ms | 256 KB |
02-25.txt | AC | 1 ms | 256 KB |
02-26.txt | WA | 1 ms | 256 KB |
02-27.txt | AC | 1 ms | 256 KB |
02-28.txt | AC | 1 ms | 256 KB |
02-29.txt | WA | 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 | 1 ms | 256 KB |
02-38.txt | AC | 1 ms | 256 KB |
02-39.txt | AC | 1 ms | 256 KB |
02-40.txt | AC | 1 ms | 256 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 |