# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420105 | Azimjon | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 204 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[]) {
vector<int> pr, sf;
pr.push_back(p[0]);
sf.push_back(p[n - 1]);
for (int i = 1; i < n; i++) {
pr.push_back(pr.back() + p[i] - p[i - 1]);
}
for (int i = n - 2; i >= 0; i--) {
sf.push_back(sf.back() + p[i + 1] - p[i]);
}
long long ans;
for (int i = 0; i < n; i++) {
ans += min(pr[i], sf[n - i - 1]);
}
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... |