# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47605 | RezwanArefin01 | Boxes with souvenirs (IOI15_boxes) | C++11 | 2 ms | 376 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;
typedef long long ll;
ll delivery(int N, int K, int L, int p[]) {
if(K == 1) {
ll tot = 0;
for(int i = 0; i < N; i++)
tot += 2 * min(p[i], L - p[i]);
return tot;
}
if(N == K) {
if(N == 1) return 2 * min(p[0], L - p[0]);
ll mn = L;
for(int i = 0; i < N - 1; i++) {
mn = min(mn, 2ll * (L + p[i] - p[i + 1]));
}
return mn;
}
}
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... |