Submission #993646
Source Code Expand
#include "bits/stdc++.h" using namespace std; //諸機能 #pragma region MACRO #define putans(x) std::cerr << "[ answer ]: " ; cout << (x) << endl #define dputans(x) std::cerr << "[ answer ]: "; cout << setprecision(40) << (double)(x) << endl #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define RREP(i,n,a) for(int i=(int)(n-1); i>= a; i--) #define rep(i,n) REP(i,0,n) #define rrep(i,n) RREP(i,n,0) #define all(a) begin((a)),end((a)) #define mp make_pair #define exist(container, n) ((container).find((n)) != (container).end()) #define equals(a,b) (fabs((a)-(b)) < EPS) #ifdef _DEBUG //ファイルからテストデータを読み込む std::ifstream ifs("data.txt"); #define put ifs >> #else //ジャッジシステムでいい感じにやる #define put cin >> #endif #pragma endregion //デバッグなどの支援 #pragma region CODING_SUPPORT #ifdef _DEBUG #define dbg(var0) { std::cerr << ( #var0 ) << "=" << ( var0 ) << endl; } #define dbg2(var0, var1) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; dbg(var1); } #define dbg3(var0, var1, var2) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; dbg2(var1, var2); } #define dbgArray(a,n) {std::cerr << (#a) << "="; rep(i,n){std::cerr <<(a[i])<<",";} cerr<<endl;} #else #define dbg(var0) {} #define dbg2(var0, var1) {} #define dbg3(var0, var1, var2) {} #define dbgArray(a,n) {} #endif #pragma endregion //typedef(書き換える、書き足す可能性ある) #pragma region TYPE_DEF typedef long long ll; typedef pair<int, int> pii; typedef pair<string, string> pss; typedef pair<int, string>pis; typedef pair<long long, long long> pll; typedef vector<int> vi; #pragma endregion //諸々の定数(書き換える可能性ある) #pragma region CONST_VAL #define PI (2*acos(0.0)) #define EPS (1e-10) #define MOD (ll)(1e9 + 7) #define INF (ll)(2*1e9) #pragma endregion int main() { int n, a; put n >> a; if (n > 1000001) { return 0; } ll dp[1000001]; rep(i, 1000001) { dp[i] = i; } REP(i, 1, n + 1) { int base = dp[i]; int j = 1; int useTime = a + j; while (i*j <= n) { dp[i*j] = min(dp[i*j], dp[i] + useTime); j++; useTime++; } } ll minT = n; REP(i, 1, n) { minT = min(minT, dp[i] + a+1 + n / i); } END: cout << minT << endl; return 0; } //int n, m; put n >> m; ////set<int> l[500000]; //set<int> usedL[500000]; //rep(i, n) { // int k; put k; // rep(j, k) { // int s; put s; // //l[s-1].insert(i); // usedL[i].insert(s - 1); // } //} //set<int> connected = { 0 }; //set<int> enableLang = usedL[0]; //REP(i, 1, n) {//i番目の人 // //if (l[i].size() < 2)continue; // // for (auto k = usedL[i].begin(); k != usedL[i].end(); k++) // { // if (enableLang.find(*k) != enableLang.end()) // { // connected.insert(*k); // for (auto ls = usedL[i].begin(); ls != usedL[i].end(); ls++) // { // enableLang.insert(*ls); // } // break; // } // } //} //cout << ( connected.size() == n ? "YES" : "NO" ) << endl;
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | pekoong |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 3053 Byte |
Status | WA |
Exec Time | 65 ms |
Memory | 8192 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 64 ms | 8064 KB |
01-02.txt | AC | 64 ms | 8064 KB |
01-03.txt | AC | 64 ms | 8064 KB |
01-04.txt | WA | 64 ms | 8064 KB |
01-05.txt | AC | 64 ms | 8064 KB |
01-06.txt | AC | 64 ms | 8064 KB |
01-07.txt | WA | 64 ms | 8064 KB |
01-08.txt | WA | 64 ms | 8064 KB |
01-09.txt | AC | 64 ms | 8064 KB |
01-10.txt | AC | 64 ms | 8064 KB |
01-11.txt | WA | 65 ms | 8064 KB |
01-12.txt | WA | 64 ms | 8064 KB |
01-13.txt | AC | 64 ms | 8064 KB |
01-14.txt | AC | 13 ms | 8064 KB |
01-15.txt | AC | 35 ms | 8192 KB |
01-16.txt | AC | 35 ms | 8064 KB |
01-17.txt | AC | 63 ms | 8064 KB |
01-18.txt | WA | 11 ms | 8064 KB |
01-19.txt | AC | 11 ms | 8064 KB |
01-20.txt | AC | 11 ms | 8064 KB |
01-21.txt | AC | 11 ms | 8064 KB |
01-22.txt | AC | 11 ms | 8064 KB |
01-23.txt | AC | 11 ms | 8064 KB |
01-24.txt | AC | 11 ms | 8064 KB |
01-25.txt | AC | 11 ms | 8064 KB |
01-26.txt | WA | 11 ms | 8064 KB |
02-01.txt | AC | 11 ms | 8064 KB |
02-02.txt | WA | 2 ms | 256 KB |
02-03.txt | WA | 2 ms | 256 KB |
02-04.txt | WA | 3 ms | 256 KB |
02-05.txt | WA | 2 ms | 256 KB |
02-06.txt | WA | 2 ms | 256 KB |
02-07.txt | WA | 3 ms | 256 KB |
02-08.txt | WA | 2 ms | 256 KB |
02-09.txt | WA | 3 ms | 256 KB |
02-10.txt | WA | 2 ms | 256 KB |
02-11.txt | WA | 2 ms | 256 KB |
02-12.txt | WA | 2 ms | 256 KB |
02-13.txt | WA | 2 ms | 256 KB |
02-14.txt | WA | 2 ms | 256 KB |
02-15.txt | WA | 2 ms | 256 KB |
02-16.txt | WA | 2 ms | 256 KB |
02-17.txt | WA | 2 ms | 256 KB |
02-18.txt | WA | 2 ms | 256 KB |
02-19.txt | WA | 2 ms | 256 KB |
02-20.txt | WA | 2 ms | 256 KB |
02-21.txt | WA | 2 ms | 256 KB |
02-22.txt | WA | 3 ms | 256 KB |
02-23.txt | WA | 2 ms | 256 KB |
02-24.txt | WA | 2 ms | 256 KB |
02-25.txt | WA | 2 ms | 256 KB |
02-26.txt | WA | 2 ms | 256 KB |
02-27.txt | WA | 2 ms | 256 KB |
02-28.txt | WA | 3 ms | 256 KB |
02-29.txt | WA | 3 ms | 256 KB |
02-30.txt | WA | 2 ms | 256 KB |
02-31.txt | WA | 2 ms | 256 KB |
02-32.txt | WA | 2 ms | 256 KB |
02-33.txt | WA | 2 ms | 256 KB |
02-34.txt | WA | 3 ms | 256 KB |
02-35.txt | WA | 3 ms | 256 KB |
02-36.txt | WA | 2 ms | 256 KB |
02-37.txt | WA | 2 ms | 256 KB |
02-38.txt | WA | 2 ms | 256 KB |
02-39.txt | WA | 2 ms | 256 KB |
02-40.txt | WA | 3 ms | 256 KB |
sample-01.txt | AC | 12 ms | 8064 KB |
sample-02.txt | WA | 2 ms | 256 KB |
sample-03.txt | AC | 16 ms | 8064 KB |