| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339605 | lucas110550 | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 400 KiB |
#include <vector>
#include <utility>
std::pair<std::vector<int>, long long> transaction(long long M); // provided by the judge
void buy_souvenirs(int N, long long P0)
{
long long M1 = P0 - 1;
auto [L1, R1] = transaction(M1);
if (L1.size() == 2) {
long long S = M1 - R1;
long long M2 = S / 2;
transaction(M2);
return;
}
long long P1 = M1 - R1;
long long M = P1 - 1;
transaction(M);
transaction(M);
}| # | 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... | ||||
