제출 #1260046

#제출 시각아이디문제언어결과실행 시간메모리
1260046robijoySouvenirs (IOI25_souvenirs)C++20
0 / 100
0 ms400 KiB
/* * Starting with the name of almighty ALLAH */ #include "souvenirs.h" // #include<bits/stdc++.h> using namespace std; // namespace { // const int CALLS_CNT_LIMIT = 10000; // int calls_cnt; // int N; // std::vector<long long> P; // std::vector<int> Q; // void quit(const char* message) { // printf("%s\n", message); // exit(0); // } // } // namespace // std::pair<std::vector<int>, long long> transaction(long long M) { // calls_cnt++; // if (calls_cnt > CALLS_CNT_LIMIT) // quit("Too many calls"); // if (M >= P[0] || M < P[N - 1]) // quit("Invalid argument"); // std::vector<int> L; // long long R = M; // for (int i = 0; i < N; i++) { // if (R >= P[i]) { // R -= P[i]; // Q[i]++; // L.push_back(i); // } // } // return {L, R}; // } void buy_souvenirs(int N, long long P0) { for (int i = 1; i < N; ++i) { transaction(N-i); } return; } // int32_t main() { // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...