Submission #1250541

#TimeUsernameProblemLanguageResultExecution timeMemory
1250541amongus_pvpSouvenirs (IOI25_souvenirs)C++20
0 / 100
12 ms412 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; void buy_souvenirs(int N, long long P0) { // N == 2 in this subtask // We know P[0] = P0, need to find P[1] // Condition: P[0] > M >= P[1] // Try smallest possible M = 1, increment until we find P[1] long long P1 = -1; for (long long m = 1; m < P0; m++) { auto [souvs, change] = transaction(m); if (!souvs.empty() && souvs[0] == 1) { // If we can buy type 1 with m coins, then P[1] <= m P1 = m; break; } } }
#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...