# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198886 | Sakamotoo | Boxes with souvenirs (IOI15_boxes) | C++14 | 61 ms | 19832 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 delivery(int n, int k, int l, int p[]) {
long long dp1[n+1],dp2[n+1];
long long jaw=1e18;
dp1[0]=0;
dp2[0]=0;
// sort(p,p+n);
for(int i=0; i<n; i++){
int x=i-k+1;
int y=n-i-1;
if(x<0){
int y=n-i-1;
dp1[i+1]=p[i]+min(p[i],l-p[i]);
dp2[i+1]=l-p[y]+min(p[y],l-p[y]);
}else {
dp1[i+1]=dp1[x]+p[i]+min(p[i],l-p[i]);
dp2[i+1]=dp2[x]+l-p[y]+min(p[y],l-p[y]);
}
//cout<<dp1[i+1]<<' '<<dp2[i+1]<<endl;
}
long long bef=1e18;
int cnt=0;
for(int i=0; i<=n; i++){
jaw=min(jaw,dp1[i]+dp2[n-i]);
if(jaw<bef) {
bef=jaw;
cnt=0;
}else {
cnt++;
if(cnt>1000) break;
}
}
return jaw;
}
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... |