| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1246389 | SpyrosAliv | 선물상자 (IOI15_boxes) | C++20 | 1 ms | 328 KiB |
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, k, l;
long long delivery(int N, int K, int L, int p[]) {
n = N;
k = K;
l = L;
assert(k == 1);
ll ans = 0;
for (int i = 0; i < n; i++) {
ll minDis = min(p[i], L - p[i]);
ans += 2 * minDis;
}
return ans;
}
| # | 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... | ||||
