Submission #1250014

#TimeUsernameProblemLanguageResultExecution timeMemory
1250014kaloyanSouvenirs (IOI25_souvenirs)C++20
4 / 100
12 ms412 KiB
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 100 + 10;

int counter[MAXN];

std::pair<std::vector<int>, long long> transaction(long long M);

void buy_souvenirs(int N, long long P0){
    
    if(N == 2) {
        auto [L, R] = transaction(P0 - 1);
        return;
    }
    
    for(int i = 1 ; i < N ; ++i){
        while(counter[i] < i){
            auto [L, R] = transaction(N - i);
        }
    }

}

#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...