Submission #993126
Source Code Expand
#include <iostream> #include <vector> #include <cstdio> #include <sstream> #include <map> #include <string> #include <algorithm> #include <queue> #include <cmath> #include <functional> #include <set> #include <ctime> #include <random> #include <chrono> #include <cassert> #include <tuple> #include <utility> using namespace std; namespace { using Integer = long long; //__int128; template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;} template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;} template<class T> istream& operator , (istream& is, T& val){ return is >> val;} template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;} template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;} template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template<class H> void print(const H& head){ cout << head; } template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template<class ... T> void println(const T& ... values){ print(values...); cout << endl; } template<class H> void eprint(const H& head){ cerr << head; } template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; inline string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()); template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); } inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } constexpr long long mod = 9_ten + 7; int main(){ long long n,a; cin >> n,a; assert(n<=1000000); assert(a<=1000000); vector<long long> dp(n+1, 1ll<<52); dp[1] = 0; long long ans = n; for(int i=1; i<n; i++){ ans = min(ans, dp[i] + (n+i-1)/i); for(int j=i+i; j<n; j+=i){ dp[j] = min(dp[j], dp[i] + (j+i-1)/i + a); } } println(ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | koyumeishi |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 3765 Byte |
Status | RE |
Exec Time | 247 ms |
Memory | 8192 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 | 83 ms | 8064 KB |
01-02.txt | AC | 83 ms | 8064 KB |
01-03.txt | AC | 83 ms | 8064 KB |
01-04.txt | AC | 84 ms | 8064 KB |
01-05.txt | AC | 84 ms | 8064 KB |
01-06.txt | AC | 84 ms | 8064 KB |
01-07.txt | AC | 83 ms | 8064 KB |
01-08.txt | AC | 84 ms | 8064 KB |
01-09.txt | AC | 83 ms | 8064 KB |
01-10.txt | AC | 84 ms | 8064 KB |
01-11.txt | AC | 83 ms | 8064 KB |
01-12.txt | AC | 83 ms | 8064 KB |
01-13.txt | AC | 83 ms | 8192 KB |
01-14.txt | AC | 6 ms | 640 KB |
01-15.txt | AC | 41 ms | 4352 KB |
01-16.txt | AC | 41 ms | 4352 KB |
01-17.txt | AC | 82 ms | 7936 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 | 2 ms | 256 KB |
01-22.txt | AC | 3 ms | 256 KB |
01-23.txt | AC | 3 ms | 256 KB |
01-24.txt | AC | 2 ms | 256 KB |
01-25.txt | AC | 3 ms | 256 KB |
01-26.txt | AC | 2 ms | 256 KB |
02-01.txt | RE | 247 ms | 256 KB |
02-02.txt | RE | 110 ms | 256 KB |
02-03.txt | RE | 110 ms | 256 KB |
02-04.txt | RE | 111 ms | 256 KB |
02-05.txt | RE | 111 ms | 256 KB |
02-06.txt | RE | 110 ms | 256 KB |
02-07.txt | RE | 111 ms | 256 KB |
02-08.txt | RE | 111 ms | 256 KB |
02-09.txt | RE | 111 ms | 256 KB |
02-10.txt | RE | 111 ms | 256 KB |
02-11.txt | RE | 111 ms | 256 KB |
02-12.txt | RE | 110 ms | 256 KB |
02-13.txt | RE | 111 ms | 256 KB |
02-14.txt | RE | 110 ms | 256 KB |
02-15.txt | RE | 111 ms | 256 KB |
02-16.txt | RE | 112 ms | 256 KB |
02-17.txt | RE | 110 ms | 256 KB |
02-18.txt | RE | 110 ms | 256 KB |
02-19.txt | RE | 110 ms | 256 KB |
02-20.txt | RE | 110 ms | 256 KB |
02-21.txt | RE | 111 ms | 256 KB |
02-22.txt | RE | 110 ms | 256 KB |
02-23.txt | RE | 112 ms | 256 KB |
02-24.txt | RE | 111 ms | 256 KB |
02-25.txt | RE | 110 ms | 256 KB |
02-26.txt | RE | 110 ms | 256 KB |
02-27.txt | RE | 111 ms | 256 KB |
02-28.txt | RE | 111 ms | 256 KB |
02-29.txt | RE | 110 ms | 256 KB |
02-30.txt | RE | 110 ms | 256 KB |
02-31.txt | RE | 110 ms | 256 KB |
02-32.txt | RE | 111 ms | 256 KB |
02-33.txt | RE | 110 ms | 256 KB |
02-34.txt | RE | 111 ms | 256 KB |
02-35.txt | RE | 110 ms | 256 KB |
02-36.txt | RE | 110 ms | 256 KB |
02-37.txt | RE | 110 ms | 256 KB |
02-38.txt | RE | 110 ms | 256 KB |
02-39.txt | RE | 110 ms | 256 KB |
02-40.txt | RE | 110 ms | 256 KB |
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | RE | 110 ms | 256 KB |
sample-03.txt | AC | 10 ms | 1152 KB |