# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1265147 | canhnam357 | 선물상자 (IOI15_boxes) | C++20 | 1 ms | 328 KiB |
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
// if (K == 1) {
// long long ans = 0;
// for (int i = 0; i < N; i++) {
// ans += min(p[i], L - p[i]) * 2;
// }
// return ans;
// }
if (K == N) {
sort(p, p + N);
return min({L, p[N - 1] * 2, (L - p[0]) * 2});
}
}
Compilation message (stderr)
# | 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... |