# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996506 | Alfraganus | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 348 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;
#define ll long long
ll delivery(int n, int k, int l, int p[]) {
sort(p, p + n);
ll ans = 1e18;
vector<int> q;
for(int i = 0; i < n; i ++)
if(p[i] != 0)
q.push_back(p[i]);
n = q.size();
vector<ll> pref(n + 1), suff(n + 1);
for(int i = 0; i < n; i ++)
pref[i + 1] = (i + 1 < k ? 0 : pref[i + 1 - k]) + q[i] * 2;
for(int i = n - 1; i >= 0; i --)
suff[i] = (i + k > n ? 0 : suff[i + k]) + 2 * l - 2 * q[i];
for(int i = 0; i <= n; i ++)
ans = min(ans, pref[i] + suff[i]);
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... |