| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1252293 | ginkgobiloba | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 412 KiB |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
std::pair<std::vector<int>, long long> transaction(long long M);
void solve_2(int N, long long P0) {
transaction(P0 - 1);
}
void solve_3(int N, long long P0) {
auto t = transaction(P0 - 1);
long long s = P0 - t.second;
transaction(s / 2);
}
void buy_souvenirs(int N, long long P0) {
if (N == 2) {
solve_2(N, P0);
return;
}
if (N == 3) {
solve_3(N, P0);
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... | ||||
