# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344987 | pggp | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 0 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>
using namespace std;
long long delivery(int N, int K, int L, vector < int > positions){
long long ans = 99999999999;
for(int to_left = 0; to_left <= N; to_left++){
vector < int > l, r;
for (int i = 0; i < to_left; ++i)
{
l.push_back(positions[i]);
}
for (int i = to_left; i < N; ++i)
{
r.push_back(positions[i]);
}
long long l_cost = 0;
long long r_cost = 0;
for (int i = 0; i < l.size(); ++i)
{
if(i % K == K - 1 or i == l.size() - 1){
l_cost += min(2 * l[i], L);
}
}
sort(r.begin(), r.end(), greater< int >());
for (int i = 0; i < r.size(); ++i)
{
if(i % K == K - 1 or i == r.size() - 1){
r_cost += min(2 * (L - r[i]), L);
}
}
//cout << ans << " " << l_cost << " " << r_cost << endl;
ans = min(ans, l_cost + r_cost);
}
return ans;
}