Submission #1249851

#TimeUsernameProblemLanguageResultExecution timeMemory
1249851PanosPaskSouvenirs (IOI25_souvenirs)C++20
4 / 100
11 ms400 KiB
#include "souvenirs.h" #include <utility> #include <vector> using namespace std; typedef long long ll; void buy_souvenirs(int N, ll P0) { vector<int> times(N, 0); ll latest = P0; for (int i = 1; i < N; i++) { ll price = 0; while (times[i] < i) { pair<vector<int>, ll> res = transaction(latest - 1); times[i]++; if (res.first.size() >= 2) { times[N - 1]++; latest--; price = latest - 1; } else { price = latest; } } latest = price; } return; }
#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...