Submission #1321083

#TimeUsernameProblemLanguageResultExecution timeMemory
1321083sadixSouvenirs (IOI25_souvenirs)C++17
4 / 100
13 ms332 KiB
#include "souvenirs.h"
#include <vector>
#include <cstdint>
#include <algorithm>

void buy_souvenirs(int N, long long P0) {
    const long long M = P0 - 1;  
    std::vector<int> bought(N, 0);

    for (int step = 0; step < 5000; step++) {

        bool done = true;
        for (int i = 1; i < N; i++) {
            if (bought[i] < i) {
                done = false;
                break;
            }
        }
        if (done) return;

        auto res = transaction(M);
        const std::vector<int>& L = res.first;

        for (int x : L) {
            if (x < N)
                bought[x]++;
        }
    }
}
#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...