Submission #7888283
Source Code Expand
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make_pair
#define pb push_back
#define EPS (1e-8)
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
using namespace std;
class pa3{
public:
int x;
int y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
int x;
int y,z,w;
pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
pa operator+(const pa & l,const pa & r) {
return {l.first+r.first,l.second+r.second};
}
pa operator-(const pa & l,const pa & r) {
return {l.first-r.first,l.second-r.second};
}
int pr[1000010];
int inv[1000010];
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
wa%=warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
int comb(int nn,int rr){
if(rr<0 || rr>nn || nn<0) return 0;
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=(pr[i-1]*i)%mod;
}
inv[ert]=beki(pr[ert],mod-2,mod);
for(int i=ert-1;i>=0;i--){
inv[i]=inv[i+1]*(i+1)%mod;
}
}
// cin.tie(0);
// ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
// mt19937(clock_per_sec);
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
//----------------kokomade tenpure------------
int jou=10000000000000000ll;
int ch(int e,int r){
vector<int> ve(r,e/r);
for(int i=0;i<e%r;i++)ve[i]++;
int p=1;
for(auto v:ve){
if(v)if(jou/v<p) return jou;
p*=v;
}
return p;
}
int solve(int r,int n){
//cout<<r<<" "<<n<<endl;
int si=0,ue=inf*100000ll;
while(ue-si>1){
int me=(ue+si)/2;
if(ch(me,r)>=n)ue=me;
else si=me;
}
//cout<<ue<<endl;
return ue;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,a;
cin>>n>>a;
int ans=n;
for(int i=2;i<=60;i++){
int p=(i-1)*a;
p+=solve(i,n);
ans=min(ans,p);
}
cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Cookies |
User |
smiken |
Language |
C++14 (GCC 5.4.1) |
Score |
1000 |
Code Size |
8788 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
sample |
dataset1 |
dataset2 |
Score / Max Score |
0 / 0 |
500 / 500 |
500 / 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 |
2 ms |
256 KB |
01-02.txt |
AC |
2 ms |
256 KB |
01-03.txt |
AC |
2 ms |
256 KB |
01-04.txt |
AC |
2 ms |
256 KB |
01-05.txt |
AC |
2 ms |
256 KB |
01-06.txt |
AC |
2 ms |
256 KB |
01-07.txt |
AC |
2 ms |
256 KB |
01-08.txt |
AC |
2 ms |
256 KB |
01-09.txt |
AC |
2 ms |
256 KB |
01-10.txt |
AC |
2 ms |
256 KB |
01-11.txt |
AC |
2 ms |
256 KB |
01-12.txt |
AC |
2 ms |
256 KB |
01-13.txt |
AC |
2 ms |
256 KB |
01-14.txt |
AC |
2 ms |
256 KB |
01-15.txt |
AC |
2 ms |
256 KB |
01-16.txt |
AC |
2 ms |
256 KB |
01-17.txt |
AC |
2 ms |
256 KB |
01-18.txt |
AC |
2 ms |
256 KB |
01-19.txt |
AC |
2 ms |
256 KB |
01-20.txt |
AC |
2 ms |
256 KB |
01-21.txt |
AC |
2 ms |
256 KB |
01-22.txt |
AC |
2 ms |
256 KB |
01-23.txt |
AC |
2 ms |
256 KB |
01-24.txt |
AC |
2 ms |
256 KB |
01-25.txt |
AC |
2 ms |
256 KB |
01-26.txt |
AC |
2 ms |
256 KB |
02-01.txt |
AC |
2 ms |
256 KB |
02-02.txt |
AC |
2 ms |
256 KB |
02-03.txt |
AC |
2 ms |
256 KB |
02-04.txt |
AC |
2 ms |
256 KB |
02-05.txt |
AC |
2 ms |
256 KB |
02-06.txt |
AC |
2 ms |
256 KB |
02-07.txt |
AC |
2 ms |
256 KB |
02-08.txt |
AC |
2 ms |
256 KB |
02-09.txt |
AC |
2 ms |
256 KB |
02-10.txt |
AC |
2 ms |
256 KB |
02-11.txt |
AC |
2 ms |
256 KB |
02-12.txt |
AC |
2 ms |
256 KB |
02-13.txt |
AC |
2 ms |
256 KB |
02-14.txt |
AC |
2 ms |
256 KB |
02-15.txt |
AC |
2 ms |
256 KB |
02-16.txt |
AC |
2 ms |
256 KB |
02-17.txt |
AC |
2 ms |
256 KB |
02-18.txt |
AC |
2 ms |
256 KB |
02-19.txt |
AC |
2 ms |
256 KB |
02-20.txt |
AC |
2 ms |
256 KB |
02-21.txt |
AC |
2 ms |
256 KB |
02-22.txt |
AC |
2 ms |
256 KB |
02-23.txt |
AC |
2 ms |
256 KB |
02-24.txt |
AC |
2 ms |
256 KB |
02-25.txt |
AC |
2 ms |
256 KB |
02-26.txt |
AC |
2 ms |
256 KB |
02-27.txt |
AC |
2 ms |
256 KB |
02-28.txt |
AC |
2 ms |
256 KB |
02-29.txt |
AC |
2 ms |
256 KB |
02-30.txt |
AC |
2 ms |
256 KB |
02-31.txt |
AC |
2 ms |
256 KB |
02-32.txt |
AC |
2 ms |
256 KB |
02-33.txt |
AC |
2 ms |
256 KB |
02-34.txt |
AC |
2 ms |
256 KB |
02-35.txt |
AC |
2 ms |
256 KB |
02-36.txt |
AC |
2 ms |
256 KB |
02-37.txt |
AC |
2 ms |
256 KB |
02-38.txt |
AC |
2 ms |
256 KB |
02-39.txt |
AC |
2 ms |
256 KB |
02-40.txt |
AC |
2 ms |
256 KB |
sample-01.txt |
AC |
2 ms |
256 KB |
sample-02.txt |
AC |
2 ms |
256 KB |
sample-03.txt |
AC |
2 ms |
256 KB |