# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014024 | MarwenElarbi | 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>
#include "boxes.h"
using namespace std;
#define pb push_back
#define ll long long
long long delivery(int N, int K, int L, int p[]) {
vector<int> a;
vector<int> b;
int k=K;
long long res=0;
for (int i = 0; i < N; ++i)
{
if(p[i]==0) continue;
if(p[i]<=L/2) a.pb(p[i]);
else b.pb(L-p[i]);
}
if(b.size()) reverse(b.begin(),b.end());
int cnt=0;
for (int i = 0; i < a.size(); ++i)
{
cnt++;
if(cnt==k){
res+=a[i]*2;
cnt=0;
}
}
ll ans=1e18;
if(cnt&&a.size()) res+=a[a.size()-1];
if(cnt&&b.size()){
ans=0;
if(a.size()) ans+=L-a[a.size()-1];
int cnt1=0;
for (int i = 0; i < (int)b.size()-cnt; ++i)
{
cnt1++;
if(cnt1==k){
ans+=b[i]*2;
cnt1=0;
}
}
if(cnt1) ans+=b[b.size()-cnt-1]*2;
}
ll cur=0;
if(cnt&&a.size()) cur+=a[a.size()-1];
cnt=0;
for (int i = 0; i < b.size(); ++i)
{
cnt++;
if(cnt==k){
cur+=b[i]*2;
cnt=0;
}
}
if(cnt&&b.size()) cur+=b[b.size()-1]*2;
long long res1=res+min(ans,cur);
return min(L,res1);
}
/*
static char _buffer[1024];
static int _currentChar = 0;
static int _charsNumber = 0;
static FILE *_inputFile, *_outputFile;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int N, K, L, i;
cin>>N>>K>>L;
int *p = (int*)malloc(sizeof(int) * (unsigned int)N);
for (i = 0; i < N; i++) {
cin>>p[i];
}
cout << delivery(N, K, L, p)<<endl;
return 0;
}*/