# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1249678 | _abaatar | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <cstring>
using namespace std;
const int Ma = 5e2+10;
using ll = long long;
void buy_souvenirs(int N, long long P0) {
// if (N == 2) transaction(P0-1);
// else {
// for (int i = N - 1; i > 0; i--) {
// for (int j = i; j > 0; j--) transaction(j);
// }
// }
ll cur = P0 - 1;
for (int i = 1; i < N; i++) {
auto res = transaction(cur);
if (res.second == 0 && res.firs.size() == 1) {
for (int j = 0; j < i - 1; j++) transaction(cur);
cur--;
}
else {
for (int j = 0; j < i - 1; j++) transaction(cur - 1);
if (res.first.size() > 1) {
for (int j = 0; j < i; j++) transaction(1);
return;
}
cur -= 2;
}
}
}