| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1250981 | wng_ | 선물 (IOI25_souvenirs) | C++20 | 1 ms | 412 KiB |
#include <bits/stdc++.h>
#include "souvenirs.h"
using namespace std;
using ll = long long;
void buy_souvenirs(int N, ll P0) {
if (N == 2) {
transaction(P0 - 1);
return;
}
if (P0 == N) {
for (int i = 1; i < N; i++) {
int price = N - i;
transaction(price * i);
}
return;
}
transaction(P0 - 1);
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... | ||||
