Submission #1249723

#TimeUsernameProblemLanguageResultExecution timeMemory
1249723enerelt14Souvenirs (IOI25_souvenirs)C++20
3 / 100
12 ms412 KiB
#include "souvenirs.h" #include <utility> #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <climits> #include <cmath> #include <complex> #include <cstring> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <stack> #include <vector> using namespace std; void buy_souvenirs(int N, long long P0) { int num = 0, price = P0; for(int i = 1; i < N - 1; i++) { pair<vector<int>, long long> res = transaction(price - 1); if(res.first.size() == 1 && !res.second) price -= 1; else if(res.first.size() == 1) price -= 2; else { price -= 2; num++; } for(int j = 0; j < i - 1; j++) { transaction(price); } } for(int i = 0; i < N - 1 - num; i++) transaction(price - 1); 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...