Submission #993188
Source Code Expand
#include <algorithm> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <iostream> #include <sstream> #include <functional> #include <map> #include <string> #include <cstring> #include <vector> #include <queue> #include <stack> #include <deque> #include <set> #include <list> #include <numeric> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const ll INF = 1e17; const ll mod = 1e9+7; #define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i)) #define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d)) #define all(v) (v).begin(), (v).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset((m),(v),sizeof(m)) #define chmin(X,Y) ((X)>(Y)?X=(Y),true:false) #define chmax(X,Y) ((X)<(Y)?X=(Y),true:false) #define fst first #define snd second #define UNIQUE(x) (x).erase(unique(all(x)),(x).end()) template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;} map<ll, ll> dp; ll n, a; ll solve(ll k){ if(dp.count(k)) return dp[k]; ll res = INF; //ll lb = 2, ub = k; //[lb, ub] for(int i = 2, l = sqrt(k)+1; i <= l; i++){ chmin(res, solve((k+i-1)/i)+a+i); } chmin(res, solve((k+k-1)/k)+a+k); return dp[k] = res; } int main(){ cin>>n>>a; dp[1] = dp[0] = 0; if(n==1) cout<<1<<endl; else cout<<solve(n)-a<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | Lepton |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1554 Byte |
Status | TLE |
Exec Time | 2102 ms |
Memory | 4096 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 11 ms | 384 KB |
01-02.txt | AC | 11 ms | 384 KB |
01-03.txt | AC | 11 ms | 384 KB |
01-04.txt | AC | 11 ms | 384 KB |
01-05.txt | AC | 11 ms | 384 KB |
01-06.txt | AC | 11 ms | 384 KB |
01-07.txt | AC | 11 ms | 384 KB |
01-08.txt | AC | 12 ms | 384 KB |
01-09.txt | AC | 13 ms | 384 KB |
01-10.txt | AC | 15 ms | 384 KB |
01-11.txt | AC | 15 ms | 384 KB |
01-12.txt | AC | 17 ms | 384 KB |
01-13.txt | AC | 17 ms | 384 KB |
01-14.txt | AC | 3 ms | 256 KB |
01-15.txt | AC | 8 ms | 384 KB |
01-16.txt | AC | 8 ms | 384 KB |
01-17.txt | AC | 11 ms | 384 KB |
01-18.txt | AC | 3 ms | 256 KB |
01-19.txt | AC | 3 ms | 256 KB |
01-20.txt | AC | 3 ms | 256 KB |
01-21.txt | AC | 3 ms | 256 KB |
01-22.txt | AC | 2 ms | 256 KB |
01-23.txt | AC | 3 ms | 256 KB |
01-24.txt | AC | 3 ms | 256 KB |
01-25.txt | AC | 3 ms | 384 KB |
01-26.txt | AC | 3 ms | 256 KB |
02-01.txt | AC | 3 ms | 256 KB |
02-02.txt | TLE | 2102 ms | 4096 KB |
02-03.txt | TLE | 2102 ms | 4096 KB |
02-04.txt | TLE | 2102 ms | 4096 KB |
02-05.txt | TLE | 2102 ms | 4096 KB |
02-06.txt | TLE | 2102 ms | 4096 KB |
02-07.txt | TLE | 2102 ms | 4096 KB |
02-08.txt | TLE | 2102 ms | 4096 KB |
02-09.txt | TLE | 2102 ms | 4096 KB |
02-10.txt | TLE | 2102 ms | 4096 KB |
02-11.txt | TLE | 2102 ms | 4096 KB |
02-12.txt | TLE | 2102 ms | 4096 KB |
02-13.txt | TLE | 2102 ms | 4096 KB |
02-14.txt | TLE | 2102 ms | 3968 KB |
02-15.txt | TLE | 2102 ms | 3968 KB |
02-16.txt | TLE | 2102 ms | 3968 KB |
02-17.txt | TLE | 2102 ms | 3840 KB |
02-18.txt | TLE | 2102 ms | 3712 KB |
02-19.txt | TLE | 2102 ms | 3328 KB |
02-20.txt | TLE | 2102 ms | 3072 KB |
02-21.txt | TLE | 2102 ms | 3072 KB |
02-22.txt | TLE | 2102 ms | 2944 KB |
02-23.txt | TLE | 2102 ms | 2944 KB |
02-24.txt | TLE | 2102 ms | 2944 KB |
02-25.txt | AC | 412 ms | 1664 KB |
02-26.txt | TLE | 2102 ms | 4096 KB |
02-27.txt | TLE | 2102 ms | 4096 KB |
02-28.txt | TLE | 2102 ms | 4096 KB |
02-29.txt | TLE | 2102 ms | 4096 KB |
02-30.txt | TLE | 2102 ms | 4096 KB |
02-31.txt | TLE | 2102 ms | 4096 KB |
02-32.txt | TLE | 2102 ms | 4096 KB |
02-33.txt | TLE | 2102 ms | 4096 KB |
02-34.txt | TLE | 2102 ms | 4096 KB |
02-35.txt | TLE | 2102 ms | 4096 KB |
02-36.txt | TLE | 2102 ms | 3968 KB |
02-37.txt | TLE | 2102 ms | 3456 KB |
02-38.txt | TLE | 2102 ms | 3072 KB |
02-39.txt | TLE | 2102 ms | 2944 KB |
02-40.txt | TLE | 2102 ms | 2944 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | TLE | 2102 ms | 2944 KB |
sample-03.txt | AC | 4 ms | 256 KB |