| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1277578 | stephit | 선물 (IOI25_souvenirs) | C++20 | 1 ms | 332 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int cnt[101];
ll p[101];
void buy_souvenirs(int n, long long p0) {
auto [v, r] = transaction(p0 - 1);
if (v.size() == 1) {
transaction(p0 - 1);
transaction(p0 - 1 - r - 1);
} else {
ll cur = p0 - 1 - r;
transaction(cur - 1);
}
}
| # | 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... | ||||
