| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345742 | kawhiet | 선물 (IOI25_souvenirs) | C++20 | 10 ms | 412 KiB |
#include <bits/stdc++.h>
#include "souvenirs.h"
using namespace std;
void buy_souvenirs(int n, long long p0) {
long long prv = p0;
for (int i = 1; i < n; i++) {
auto [pos, r] = transaction(prv - 1);
if (r == 1) {
prv -= 2;
} else {
prv--;
}
for (int j = 1; j < i; j++) {
transaction(prv);
}
}
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... | ||||
