| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1252295 | ginkgobiloba | 선물 (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 - 1 - t.second;
if (t.first.size() == 1) {
transaction(s - 1);
transaction(s - 1);
} else {
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... | ||||
