# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402993 | EJOI2019Andrew | 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 "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long mn(int a,int b)
{
if(a<b)
return a;
return b;
}
long long delivery(int N, int K,int L, int p[]) {
if(K==N)
{
sort(p, p+N);
int mid = L/2;
int sum = 0;
for(int i = 0; i < N; i++)
{
if(p[i] <= mid)
{
sum = p[i]*2;
}
else if(p[i] > mid)
{
sum+=((L-p[i])*2);
break;
}
}
return min(sum, L);
}
if(K==1)
{
long long ans = 0;
for(int i = 0; i < N; ++i)
ans+=mn(p[i],L-p[i])*2;
return ans;
}
else
{
long long ans = N*N;
for(int i = 0; i < N; ++i)
{
long long s1=0;
for(int j=i; j<N; ++j)
s1+=mn(mn(p[i],L-p[i])*2,L);
for(int j=i-1; j>=0; --j)
s1+=mn(mn(p[i],L-p[i])*2,L);
ans=min(ans,s1);
}
return ans;