# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
691744 | zeroesandones | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 312 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"
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
#define pb emplace_back
ll delivery(int N, int K, int L, int p[]) {
ll ans = L;
for(int i = 0; i < N - 1; ++i) {
ll curr = 2 * p[i] + 2 * (L - p[i + 1]);
ans = min(ans, curr);
}
ans = min(ans, (ll) 2 * p[N -1]);
ans = min(ans, (ll) 2 * (L - p[0]));
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... |