Submission #9341359


Source Code Expand

Copy
//Zory-2019
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1ll<<(x))
#define fo(i,l,r) for(int i=(l),I=(r);i<=I;i++)
#define fd(i,r,l) for(int i=(r),I=(l);i>=I;i--)
#define Debug printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define debug(x) cerr<<#x<<'='<<x<<endl
#define mem(x,val) memset(x,val,sizeof x)
namespace mine
{
    ll qread()
    {
        ll ans=0,f=1;char c=getchar();
        while(c<'0' or c>'9') {if(c=='-')f=-1;c=getchar();}
        while('0'<=c and c<='9') ans=ans*10+c-'0',c=getchar();
        return ans*f;
    }
    void write(ll num){if(num<0) putchar('-'),num=-num;if(num>=10) write(num/10);putchar('0'+num%10);}
    void write1(ll num){write(num);putchar(' ');}
    void write2(ll num){write(num);putchar('\n');}
    template<typename T>inline bool chmax(T&a,const T&b){return a<b?a=b,1:0;}
    template<typename T>inline bool chmin(T&a,const T&b){return a>b?a=b,1:0;}
    ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
    bool IN(ll x,ll l,ll r){return l<=x and x<=r;}

    const int INF=0x3f3f3f3f;
    const int MOD=1e9+7;
    int mm(const int x){return x>=MOD?x-MOD:x;}
    template<typename T> void add(T &x,const int &y){x=(x+y>=MOD?x+y-MOD:x+y);}
    ll qpower(ll x,ll e,int mod=MOD){ll ans=1;while(e){if(e&1)ans=ans*x%mod;x=x*x%mod;e>>=1;}return ans;}
    ll invm(ll x){return qpower(x,MOD-2);}
    const int N=1e6+10;

    void main()
	{
        ll n=qread(),A=qread(),ans=n;
        fo(k,0,40)
        {
            ll x=pow(n,1.0/(k+1)),y=x+1;
            fo(i,0,k+1)
            {
                ll now=1;
                fo(t,1,i) {now=now*x;if(now>=n)break;}
                fo(t,1,k+1-i) {now=now*y;if(now>=n)break;}
                if(now>=n) chmin(ans, A*k+i*x+(k+1-i)*y );
            }
        }
        write(ans);
	}
};//(ans+MOD)%MOD
signed main()
{
    srand(time(0));
    mine::main();
}

Submission Info

Submission Time
Task E - Cookies
User Zory
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2190 Byte
Status
Exec Time 2 ms
Memory 384 KB

Test Cases

Set Name Score / Max Score Test Cases
sample 0 / 0 sample-01.txt, sample-02.txt, sample-03.txt
dataset1 500 / 500 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 500 / 500 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 1 ms 256 KB
01-02.txt 1 ms 256 KB
01-03.txt 1 ms 256 KB
01-04.txt 1 ms 256 KB
01-05.txt 1 ms 256 KB
01-06.txt 1 ms 256 KB
01-07.txt 1 ms 256 KB
01-08.txt 1 ms 256 KB
01-09.txt 1 ms 256 KB
01-10.txt 1 ms 256 KB
01-11.txt 1 ms 256 KB
01-12.txt 1 ms 256 KB
01-13.txt 1 ms 256 KB
01-14.txt 1 ms 256 KB
01-15.txt 1 ms 256 KB
01-16.txt 1 ms 256 KB
01-17.txt 1 ms 256 KB
01-18.txt 1 ms 384 KB
01-19.txt 1 ms 256 KB
01-20.txt 1 ms 256 KB
01-21.txt 1 ms 256 KB
01-22.txt 1 ms 256 KB
01-23.txt 1 ms 256 KB
01-24.txt 1 ms 256 KB
01-25.txt 1 ms 256 KB
01-26.txt 1 ms 256 KB
02-01.txt 1 ms 256 KB
02-02.txt 1 ms 256 KB
02-03.txt 1 ms 256 KB
02-04.txt 1 ms 256 KB
02-05.txt 1 ms 256 KB
02-06.txt 1 ms 256 KB
02-07.txt 1 ms 256 KB
02-08.txt 1 ms 256 KB
02-09.txt 1 ms 256 KB
02-10.txt 1 ms 256 KB
02-11.txt 1 ms 256 KB
02-12.txt 1 ms 256 KB
02-13.txt 2 ms 256 KB
02-14.txt 1 ms 256 KB
02-15.txt 1 ms 256 KB
02-16.txt 1 ms 256 KB
02-17.txt 1 ms 256 KB
02-18.txt 1 ms 256 KB
02-19.txt 1 ms 256 KB
02-20.txt 1 ms 256 KB
02-21.txt 1 ms 256 KB
02-22.txt 1 ms 256 KB
02-23.txt 1 ms 256 KB
02-24.txt 1 ms 256 KB
02-25.txt 1 ms 256 KB
02-26.txt 1 ms 256 KB
02-27.txt 1 ms 256 KB
02-28.txt 1 ms 256 KB
02-29.txt 1 ms 256 KB
02-30.txt 1 ms 256 KB
02-31.txt 1 ms 256 KB
02-32.txt 1 ms 256 KB
02-33.txt 1 ms 256 KB
02-34.txt 1 ms 256 KB
02-35.txt 1 ms 256 KB
02-36.txt 1 ms 256 KB
02-37.txt 1 ms 256 KB
02-38.txt 1 ms 256 KB
02-39.txt 1 ms 256 KB
02-40.txt 1 ms 256 KB
sample-01.txt 1 ms 256 KB
sample-02.txt 1 ms 256 KB
sample-03.txt 1 ms 256 KB