# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996345 | Alfraganus | Boxes with souvenirs (IOI15_boxes) | C++17 | 5 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[]) {
ll ans = 1e18;
auto get = [&](ll x){return min(x, l - x);};
vector<int> q;
for(int i = 0; i < n; i ++)
if(p[i] != 0)
q.push_back(p[i]);
n = (int)q.size();
for(int i = 0; i <= n; i ++){
deque<int> dq;
for(int j = 0; j < i; j ++)
dq.push_back(q[j]);
ll mx = 0;
while(dq.size() > 0){
int sz = (int)dq.size();
ll clock = dq[min(sz - 1, k - 1)] + get(dq[min(sz - 1, k - 1)]);
mx += clock;
for(int i = 0; i < min(sz, k); i ++)
dq.pop_front();
}
for(int j = i; j < n; j ++)
dq.push_back(q[j]);
while(dq.size() > 0){
int sz = (int)dq.size();
ll counterclock = dq[max(0, sz - k)] + get(dq[max(0, sz - k)]);
mx += counterclock;
for(int i = 0; i < min(sz, k); i ++)
dq.pop_back();
}
ans = min(ans, mx);
}
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... |