Submission #5537839
Source Code Expand
#include <stdio.h> #include <algorithm> #include <assert.h> #include <bitset> #include <cmath> #include <complex> #include <deque> #include <functional> #include <iostream> #include <limits.h> #include <map> #include <math.h> #include <queue> #include <set> #include <stdlib.h> #include <string.h> #include <string> #include <time.h> #include <unordered_map> #include <unordered_set> #include <vector> #include <chrono> #include <random> #include <time.h> #define ll long long #define rep2(i,a,b) for(ll i=a;i<=b;++i) #define rep(i,n) for(ll i=0;i<n;i++) #define rep3(i,a,b) for(ll i=a;i>=b;i--) #define REP(e,v) for(auto e:v) #define pii pair<int,int> #define pll pair<ll,ll> #define tii tuple<int,int,int> #define pq priority_queue<int> #define pqg priority_queue<int,vector<int>,greater<int>> #define pb push_back #define edge(v,a,b) v[a].pb(b);v[b].pb(a); #define MAX_V 400010 #define vec vector<int> #define vecll vector<ll> #define vecpii vector<pii> #define endl "\n" #define ALL(c) (c).begin(),(c).end() using namespace std; int in() {int x;scanf("%d",&x);return x;} ll lin() {ll x;scanf("%lld",&x);return x;} #define INF 1e9+7 #define LLINF 1e18+7 #define N 500000 ll MOD=1e9+7; ll dp[2000000]; main(){ ll n=lin(); ll a=lin(); dp[1]=1ll; if(n==1){cout<<1;return 0;} if(a<=30000){ rep2(i,2,N){ ll m=i; rep2(j,1,i-1-a){ ll s=dp[j]*((i-j-a)); m=max(m,s); } dp[i]=m; if(m>=n){ cout<<i;return 0; } } } else if(a*a<4*n){ ll l=2*a,r=3*a; while(l<r-1){ ll mid=(l+r)/2; ll t=0; rep2(i,a,2*a){ ll s=max(i,(i-a)*(i-a)/4); t=max(t,s*(mid-i-a)); } if(t>=n)r=mid; else l=mid; } cout<<r; } else{ if(a>=n){cout<<n;return 0;} ll l=1,r=INF; n=n*4; while(l<r-1){ ll mid=(l+r)/2; if(mid*mid>=n)r=mid; else l=mid; } cout<<a+r; } }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | noimi |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 2251 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 896 KB |
Compile Error
./Main.cpp: In function ‘int in()’: ./Main.cpp:44:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int in() {int x;scanf("%d",&x);return x;} ^ ./Main.cpp: In function ‘long long int lin()’: ./Main.cpp:45:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] ll lin() {ll x;scanf("%lld",&x);return x;} ^
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 | 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 | 1 ms | 256 KB |
02-17.txt | AC | 2 ms | 256 KB |
02-18.txt | AC | 2 ms | 256 KB |
02-19.txt | AC | 7 ms | 256 KB |
02-20.txt | AC | 50 ms | 384 KB |
02-21.txt | AC | 1701 ms | 896 KB |
02-22.txt | WA | 70 ms | 256 KB |
02-23.txt | TLE | 2103 ms | 256 KB |
02-24.txt | TLE | 2103 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 | 6 ms | 256 KB |
02-38.txt | AC | 100 ms | 384 KB |
02-39.txt | AC | 31 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 |