# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101329 | ansol4328 | Boxes with souvenirs (IOI15_boxes) | C++11 | 3 ms | 512 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<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
long long delivery(int N, int K, int L, int *positions)
{
long long res=0;
vector<int> lst1, lst2;
for(int i=0 ; i<N ; i++)
{
if(positions[i]>L/2) break;
lst1.push_back(positions[i]);
positions[i]=-1;
}
for(int i=N-1 ; i>=0 ; i--)
{
if(positions[i]==-1) break;
lst2.push_back(positions[i]);
positions[i]=-1;
}
int idx1=-1, idx2=-1;
for(int i=K-1 ; i<lst1.size() ; idx1=i, i+=K) res+=2*lst1[i];
for(int i=K-1 ; i<lst2.size() ; idx2=i, i+=K) res+=2*(L-lst1[i]);
int rm1=lst1.size()-idx1-1, rm2=lst2.size()-idx2-1;
int v1=0, v2=L, v3=L;
if(rm1) v1+=2*lst1[lst1.size()-1];
if(rm2) v1+=2*(L-lst2[lst2.size()-1]);
if(rm1+rm2>=K)
{
int x=rm1+rm2-K;
if(x)
{
v2+=2*(L-lst2[idx2+x]);
v3+=2*lst1[idx1+x];
}
}
res+=min(v1,min(v2,v3));
return res;
}
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... |