# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1249506 | Charizard2021 | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include "souvenirs.h"
#include<bits/stdc++.h>
using namespace std;
void buy_souvenirs(int N, long long P0){
if(N == 2){
pair<vector<int>, long long> res = transaction(P0 - 1);
return;
}
else{
int cur = P0;
int numberFor1 = N - 1;
for(int i = 1; i < N; i++){
cur--;
pair<vector<int>, long long> res = transaction(cur);
if(res.second == 0){
numberFor1--;
cur--;
}
if(i != n - 1){
for(int j = 1; j < i; j++){
pair<vector<int>, long long> res = transaction(cur);
}
}
else{
for(int j = 0; j < numberFor1; j++){
pair<vector<int>, long long> res = transaction(cur);
}
}
}
}
}