| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1345302 | Jer | Souvenirs (IOI25_souvenirs) | C++20 | 8 ms | 344 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void buy_souvenirs(int n, long long p0)
{
ll curr = p0;
pair<vector<int>, ll> res;
vector<int> done(n + 1, 0);
for (int i = 1; i < n; i++)
{
if (i == n - 1)
curr++;
res = transaction(curr - 2);
if (res.first[0] == i)
curr -= 2;
else
curr--;
for (auto i : res.first)
done[i]++;
while (done[i] < i)
transaction(curr), done[i]++;
}
return;
}
| # | 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... | ||||
