# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1258942 | dattenlamj | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
std::pair<std::vector<int>, long long> transaction(long long M) ;
void buy_souvenirs(int n, long long P0){
auto [v,x] = transaction(P0-1);
int a[n];
for (int i=0;i<n;i++){
a[i]=0;
}
a[0]=P0;
if (v.size()==1){
a[1]=P0-1-x;
transaction(a[1]-1);
transaction(a[1]-1);
}
else{
int y=P0-x;
transaction(y/2);
}
}