| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 793451 | Markynoodle | Boxes with souvenirs (IOI15_boxes) | C++17 | 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;
#define ll long long
ll delivery(int n, int k, int l, vector<int> pos){
ll sol = 1e16;
sort(pos.begin(), pos.end());
for(int i = 0; i<=n; i++){
ll tempsol = 0;
int cnt = 0;
int cycle = 0;
while(cnt < i){
if(cnt + 1 == i){
tempsol += pos[cnt];
tempsol += min(pos[cnt], l - pos[cnt]);
break;
}
if(cycle == k){
tempsol += pos[cnt];
tempsol += min(pos[cnt], l - pos[cnt]);
cycle = 0;
}
cnt++;
cycle++;
}
//cout<<tempsol<<" ";
cnt = n;
cycle = 0;
while(cnt >= i){
if(cnt == i){
tempsol += l - pos[cnt];
tempsol += min(pos[cnt], l - pos[cnt]);
break;
}
if(cycle == k){
tempsol += l - pos[cnt];
tempsol += min(pos[cnt], l - pos[cnt]);
cycle = 0;
}
cnt--;
cycle++;
}
sol = min(sol, tempsol);
//cout<<tempsol<<"_";
}
return sol;
}