# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568385 | CSQ31 | Boxes with souvenirs (IOI15_boxes) | C++17 | 1 ms | 340 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;
typedef long long int ll;
ll delivery(int n, int k, int L, int p[]) {
vector<ll>pref(n,0),suff(n,0);
vector<vector<int>>c(k);
for(int i=0;i<n;i++)c[i%k].push_back(i);
for(int i=0;i<k;i++){
int s = c[i].size();
ll sum = 0;
for(int j=0;j<s;j++){
sum+=p[c[i][j]];
if(j>=k)sum-=p[c[i][j-k]];
pref[c[i][j]] = 2*sum;
}
sum = 0;
for(int j=s-1;j>=0;j--){
sum+=L-p[c[i][j]];
if(j+k<s)sum-=p[c[i][j+k]];
suff[c[i][j]] = 2*sum;
}
}
ll ans = 1e18;
ans = min(ans,suff[0]);
ans = min(ans,pref[n-1]);
for(int i=0;i+1<n;i++)ans = min(ans,pref[i] + suff[i+1]);
return ans;
for(int i=k-1;i<n;i++){
ll cost = L;
if(i-k>=0)cost+=pref[i-k];
if(i+1<n)cost+=suff[i+1];
ans = min(ans,cost);
}
return ans;
}
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... |