| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1252143 | bzzzzzzzzzz | 선물 (IOI25_souvenirs) | C++20 | 12 ms | 412 KiB |
#include <bits/stdc++.h>
#include "souvenirs.h"
using namespace std;
using ll = long long;
void buy_souvenirs(int N, long long P0) {
if (N == 2) {
pair<vector<int>, ll> p = transaction(P0 - 1);
} else if (N == 3) {
auto[v, s] = transaction(P0 - 1);
if ((int)v.size() == 1) {
transaction(P0 - s - 2);
transaction(P0 - s - 2);
} else {
transaction((P0 - 1 - s) / 2);
}
} else {
for (int i = 1; i < N; i++) {
for (int j = 0; j < i; j++) {
transaction(N - i);
}
}
}
}| # | 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... | ||||
