| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1252874 | kkzyr | 선물 (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 buy_souvenirs(int N, long long P0){
if (N == 2){
transaction(P0 - 1);
}
else if (N == 3){
std::pair<std::vector<int>, long long> result;
result = transaction(P0 - 1);
if (result.first.size() == 1){
transaction(((P0 - 1) - result.second) - 1);
transaction(((P0 - 1) - result.second) - 1);
}
else{
transaction(((P0 - 1) - result.second)/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... | ||||
