| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1257539 | Canuc80k | 선물 (IOI25_souvenirs) | C++20 | 12 ms | 412 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
std::pair<std::vector<int>, long long> transaction(long long M);
ll res[101];
void buy_souvenirs(int n, long long p) {
res[0] = p;
for (int i = 1; i < n; i ++) {
auto [v, x] = transaction(res[i - 1] - 1);
res[i] = res[i - 1] - 1 - x;
for (int j = 1; j < i; j ++) transaction(res[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... | ||||
