Submission #1321028

#TimeUsernameProblemLanguageResultExecution timeMemory
1321028sadixSouvenirs (IOI25_souvenirs)C++20
4 / 100
13 ms332 KiB
#include <bits/stdc++.h> using namespace std; pair<vector<int>, long long> transaction(long long M); void buy_souvenirs(int N, long long P0) { vector<int> bought(N, 0); for (int type = 1; type < N; type++) { while (bought[type] < type) { long long M = P0 - 1; // сукааа пиздец я долбаеб нахуй auto res = transaction(M); auto &L = res.first; if ((int)L.size() == 1 && L[0] == type) { bought[type]++; } } } }
#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...