# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115501 | E869120 | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
long long minx = (1LL << 60);
minx = min(minx, 2LL * (L - p[0]));
minx = min(minx, 2LL * p[N - 1]);
for (int i = 0; i < N - 1; i++) minx = min(minx, 2LL * (L - (p[i + 1] - p[i])));
/*for (int i = -1; i < N; i++) {
long long sum = 0;
for (int j = i; j >= 0; j -= K) sum += 1LL * p[j];
for (int j = i + 1; j < N; j += K) sum += 1LL * (L - p[j]);
minx = min(minx, 2LL * sum);
}*/
return minx;
}
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... |