Submission #1250837

#TimeUsernameProblemLanguageResultExecution timeMemory
1250837JoksimKaktusSouvenirs (IOI25_souvenirs)C++20
3 / 100
11 ms412 KiB
#include "souvenirs.h"
#include <bits/stdc++.h>

using namespace std;

void buy_souvenirs(int N, long long p) {
    int bet = p-1;
    int repeat = 1;
    int one = 0;
    for(int i = N-1;i > 1;i--){
        for(int j = 0;j < repeat;j++){
            if(j == 0){
                pair<vector<int>,long long> k = transaction(bet);
                if(k.first.size() == 2){
                    one++;
                    bet--;
                }else if(k.second == 1){
                    bet--;
                }
            }else{
                transaction(bet);
            }
        }
        bet--;
        repeat++;
    }
    while(one < N-1){
        one++;
        transaction(bet);
    }
    return;
}
#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...