| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1256255 | bynix | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 412 KiB |
#include "souvenirs.h"
#include "bits/stdc++.h"
void buy_souvenirs(int N, long long P0) {
auto[l, r] = transaction(P0 - 1);
if (N == 2) return;
if (l.size() == 1){
transaction(P0 - 2 - r);
transaction(P0 - 2 - r);
} else {
transaction((P0 - 2 - r)/2);
}
}| # | 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... | ||||
