| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1352145 | d4n13l | Souvenirs (IOI25_souvenirs) | C++20 | 8 ms | 412 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
//#define int long long
using ll = long long;
using namespace std;
void buy_souvenirs(int n, long long p0) {
int cur = n-1;
ll last = p0;
for (int i = 1; i <= n-1; i++) {
if (i==n-1) {
for (int j = 0; j < cur; j++) {
transaction(last-1);
}
continue;
}
auto p = transaction(last-1);
ll l = p.first.size(), r=p.second;
ll ask = 0;
if (r>0) {
ask = last-2;
last = last-2;
} else {
if (l>1) {
ask = last-2;
last=last-2;
cur--;
} else {
ask = last-1;
last=last-1;
}
}
for (int j = 1; j < i; j++) {
transaction(last);
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
