Submission #993788
Source Code Expand
#include <bits/stdc++.h> #include<iostream> #include<cstdio> #include<vector> #include<queue> #include<map> #include<cstring> #include<string> #include <math.h> #include<algorithm> // #include <boost/multiprecision/cpp_int.hpp> #include<functional> #define int long long #define inf 1000000007 #define pa pair<int,int> #define ll long long #define pal pair<ll,ll> #define ppa pair<int,pa> #define mp make_pair #define pb push_back #define EPS (1e-10) #define equals(a,b) (fabs((a)-(b))<EPS) using namespace std; class Point{ public: double x,y; Point(double x=0,double y=0):x(x),y(y) {} Point operator + (Point p) {return Point(x+p.x,y+p.y);} Point operator - (Point p) {return Point(x-p.x,y-p.y);} Point operator * (double a) {return Point(x*a,y*a);} Point operator / (double a) {return Point(x/a,y/a);} double absv() {return sqrt(norm());} double norm() {return x*x+y*y;} bool operator < (const Point &p) const{ return x != p.x ? x<p.x: y<p.y; } bool operator == (const Point &p) const{ return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS; } }; typedef Point Vector; struct Segment{ Point p1,p2; }; double hen(Vector a){ if(fabs(a.x)<EPS && a.y>0) return acos(0); else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0); else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0); else if(fabs(a.y)<EPS && a.x>0) return 0.0; else if(a.y>0) return acos(a.x/a.absv()); else return 2*acos(0)+acos(-a.x/a.absv()); } 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); } double dot(Vector a,Vector b){ return a.x*b.x+a.y*b.y; } double cross(Vector a,Vector b){ return a.x*b.y-a.y*b.x; } //----------------kokomade tenpure------------ map<int ,int> timez; int a,n; int saiki(int d){//d ni toutatu suru saisyou jikan if(timez.find(d)!=timez.end()) return timez[d]; int u=d; int z; for(int l=2;l<=1000;l++){ z= d/l; if(d%l!=0) z++; if(z==1) continue; u=min(u,saiki(z)+a+1+l-1); } for(int i=1;i<=z;i++){ int l=d/z; if(d%z!=0) l++; u=min(u,saiki(z)+a+1+l-1); } timez[d]=u; return u; } signed main(){ cin>>n>>a; // if(n>1000002) return 0; // for(int i=0;i<1000002;i++) timez[i]=-1; timez[0]=0; timez[1]=1; timez[2]=2; int z; /* for(int i=1;i<=n;i++){ z=saiki(i); // cout<<z<<endl; } cout<<z<<endl; */ cout<<saiki(n)<<endl; // printf("%.10f\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | smiken |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 3271 Byte |
Status | TLE |
Exec Time | 2102 ms |
Memory | 2176 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 | 58 ms | 384 KB |
01-02.txt | AC | 57 ms | 384 KB |
01-03.txt | AC | 58 ms | 384 KB |
01-04.txt | AC | 57 ms | 384 KB |
01-05.txt | AC | 57 ms | 384 KB |
01-06.txt | AC | 58 ms | 384 KB |
01-07.txt | AC | 57 ms | 384 KB |
01-08.txt | AC | 57 ms | 384 KB |
01-09.txt | AC | 57 ms | 384 KB |
01-10.txt | AC | 57 ms | 384 KB |
01-11.txt | AC | 58 ms | 384 KB |
01-12.txt | AC | 58 ms | 384 KB |
01-13.txt | AC | 58 ms | 384 KB |
01-14.txt | AC | 11 ms | 256 KB |
01-15.txt | AC | 39 ms | 384 KB |
01-16.txt | AC | 39 ms | 384 KB |
01-17.txt | AC | 57 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 | 3 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 | 256 KB |
01-26.txt | AC | 3 ms | 256 KB |
02-01.txt | AC | 3 ms | 256 KB |
02-02.txt | TLE | 2102 ms | 2176 KB |
02-03.txt | TLE | 2102 ms | 2176 KB |
02-04.txt | TLE | 2102 ms | 2176 KB |
02-05.txt | TLE | 2102 ms | 2176 KB |
02-06.txt | TLE | 2102 ms | 2176 KB |
02-07.txt | TLE | 2102 ms | 2176 KB |
02-08.txt | TLE | 2102 ms | 2176 KB |
02-09.txt | TLE | 2102 ms | 2176 KB |
02-10.txt | TLE | 2102 ms | 2176 KB |
02-11.txt | TLE | 2102 ms | 2176 KB |
02-12.txt | TLE | 2102 ms | 2176 KB |
02-13.txt | TLE | 2102 ms | 2176 KB |
02-14.txt | TLE | 2102 ms | 2176 KB |
02-15.txt | TLE | 2102 ms | 2176 KB |
02-16.txt | TLE | 2102 ms | 2176 KB |
02-17.txt | TLE | 2102 ms | 2176 KB |
02-18.txt | TLE | 2102 ms | 2176 KB |
02-19.txt | TLE | 2102 ms | 2176 KB |
02-20.txt | TLE | 2102 ms | 2176 KB |
02-21.txt | TLE | 2102 ms | 2176 KB |
02-22.txt | TLE | 2102 ms | 2176 KB |
02-23.txt | TLE | 2102 ms | 2176 KB |
02-24.txt | TLE | 2102 ms | 2176 KB |
02-25.txt | AC | 1027 ms | 1408 KB |
02-26.txt | TLE | 2102 ms | 2176 KB |
02-27.txt | TLE | 2102 ms | 2176 KB |
02-28.txt | TLE | 2102 ms | 2176 KB |
02-29.txt | TLE | 2102 ms | 2176 KB |
02-30.txt | TLE | 2102 ms | 2176 KB |
02-31.txt | TLE | 2102 ms | 2176 KB |
02-32.txt | TLE | 2102 ms | 2176 KB |
02-33.txt | TLE | 2102 ms | 2176 KB |
02-34.txt | TLE | 2102 ms | 2176 KB |
02-35.txt | TLE | 2102 ms | 2176 KB |
02-36.txt | TLE | 2102 ms | 2176 KB |
02-37.txt | TLE | 2102 ms | 2176 KB |
02-38.txt | TLE | 2102 ms | 2176 KB |
02-39.txt | TLE | 2102 ms | 2176 KB |
02-40.txt | TLE | 2102 ms | 2176 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | TLE | 2102 ms | 2176 KB |
sample-03.txt | AC | 16 ms | 256 KB |