# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
668578 | alvingogo | Boxes with souvenirs (IOI15_boxes) | C++14 | 501 ms | 196228 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>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
long long delivery(int N,int K,int L,int positions[]){
int n=N,k=K,l=L;
auto p=positions;
vector<long long> a,b;
for(int i=0;i<n;i++){
if(p[i]<=L/2){
a.push_back(p[i]);
}
else{
b.push_back(L-p[i]);
}
}
reverse(b.begin(),b.end());
auto c=a,d=b;
for(int i=k;i<a.size();i++){
c[i]+=c[i-k];
}
for(int i=k;i<b.size();i++){
d[i]+=d[i-k];
}
long long ms=l;
if(!a.size()){
return 2*d.back();
}
if(!b.size()){
return 2*c.back();
}
ms=min(ms,2*a.back()+2*b.back());
long long ans=1e18;
ans=min(ans,2*c.back()+2*d.back());
int h=a.size(),u=b.size();
for(int i=0;i<k;i++){
//c[h-1]+d[u-1];
long long e=0;
if(h-k+i>=0){
e=2*c[h-k+i];
}
long long f=0;
if(u-i-2>=0){
f=2*d[u-i-2];
}
ans=min(ans,e+f+ms);
}
return ans;
}
/*
int main(){
int p[5]={44,48,59,66,90};
cout << delivery(5,4,110,p) << "\n";
}
*/
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... |