| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1284533 | dimitri.shengelia | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
#include <utility>
#include <vector>
using namespace std;
pair <vector<int>, long long> transaction(long long M);
void buy_souvenirs(int N, long long P0) {
pair <vector<int>, long long> res;
pair <int, bool> a[n];
fill ( a, a + n, { 0, false } );
a[0].first = P0;
if ( N == 2 ) {
transaction ( P0 - 1 );
} else if ( N == 3 ) {
res = transaction ( P0 - 1 );
if ( res.first.size() == 1 ) {
transaction ( P0 - 1 - res.second - 1 );
transaction ( P0 - 1 - res.second - 1 );
} else {
transaction ( ( P0 - 1 - res.second ) / 2 );
}
} else {
}
return;
}
