| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1323709 | marzuq01 | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 400 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
#define T std::pair<std::vector<int>, long long>
using namespace std;
void buy_souvenirs(int N, long long P0) {
//n = 3;
T res = transaction(P0-1ll);
long long coin = P0 - 1ll - res.second;
vector<int> v = res.first;
if (v.size() == 1) {
res = transaction(coin-1ll);
res = transaction(coin-1ll);
} else {
int now = (coin)/2ll;
res = transaction(now);
}
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... | ||||
