| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1269280 | sula2 | Souvenirs (IOI25_souvenirs) | C++20 | 12 ms | 408 KiB |
#include <bits/stdc++.h>
#include "souvenirs.h"
using namespace std;
void buy_souvenirs(int N, long long P0) {
long long P[N] = {}, Q[N] = {};
P[0] = P0;
for (int i = 1; i < N; i++) {
auto [a,b] = transaction(P[i] == 0 ? P[i-1] - 1 : P[i]);
if (P[i] == 0) {
P[i] = P[i-1] - a.size();
}
for (int j : a) Q[j]++;
}
for (int i = 1; i < N; i++)
while (Q[i] < i)
transaction(P[i]), Q[i]++;
}| # | 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... | ||||
