# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64885 | Talant | Boxes with souvenirs (IOI15_boxes) | C++17 | 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 "grader.cpp"
#include <bits/stdc++.h>
#define mk make_pair
#define sc second
#define fr first
#define pb push_back
using namespace std;
const int N = (1e6 + 5);
const int inf = (1e9 + 7);
long long ans;
long long delivery(int N, int K, int L, int p[]) {
if (K == 1) {
for (int i = 0; i < N; i ++)
ans += min(p[i] * 2,(L - p[i]) * 2);
}
else if (K == N) {
ans = L;
for (int i = 0; i < N; i ++)
ans = min(ans,(long long)(p[i] * 2 + (L - p[i + 1]) * 2));
ans = min(ans,(long long)(L - p[0]) * 2);
ans = min(ans,(long long)(p[N - 1] * 2));
}
return ans;
}
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... |