# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1252911 | kkzyr | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
void buy_souvenirs(int N, long long P0){
long long nxt = P0 - 1;
int how_many_last = 0;
for (int i = 1;i < N;i++){
pair<vector<int>, long long> result;
result = transaction(nxt);
if (result.first.size() == 2 or result.second == 0){
if (result.first.size() == 2){
how_many_last++;
}
nxt--;
}
if (i == N - 1){
for (int j = 1;j < (i - how_many_last);j++){
transaction(nxt);
}
}
else{
for (int j = 1;j < i;j++){
transaction(nxt);
}
}
nxt--;
}
}