# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431141 | proma | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 296 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 <bits/stdc++.h>
#include "boxes.h"
#define see(x) cerr<<#x<<"="<<"\n";
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
long long ans = L;
long long pos1 = 0, pos2 = L;
for (int i = 0; i < N; i ++) {
if (p[i] <= L / 2) pos1 = p[i];
else if (pos2 == L) pos2 = p[i];
}
ans = min(ans, 2 * pos1 + 2 * (L - pos2));
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... |