Submission #1286245

#TimeUsernameProblemLanguageResultExecution timeMemory
1286245kaxiSouvenirs (IOI25_souvenirs)C++20
4 / 100
1 ms388 KiB
#include "souvenirs.h"
#include <utility>
#include <vector>

void buy_souvenirs(int N, long long P0) {
	if (N == 2) {
        transaction(P0 - 1);
        return;
    }
    if (P0 == N) {
        for (long long M = N - 1; M >= 1; --M) {
            transaction(M);
        }
        return;
    }
    for (long long M = P0 - 1; M >= std::max(1LL, P0 - N); --M) {
        transaction(M);
    }
}
#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...