Submission #139998

#TimeUsernameProblemLanguageResultExecution timeMemory
139998MrBrionixBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
2 ms380 KiB
//#include "boxes.h" #include <stdio.h> #include <stdlib.h> #include<bits/stdc++.h> using namespace std; long long pre[10000005],suf[20000005],sum,sol,n,l; long long delivery(int N, int K, int L, int p[]) { n=N; l=L; sol=1000000000000000000ll; for(int i=0;i<K;i++){ sum=0; for(int j=i;j<N;j+=K){ sum+=p[j]*2ll; pre[j]=sum; } } for(int i=N-1;i>=N-K;i--){ sum=0; for(int j=i;j>=0;j-=K){ sum+=(l-p[j])*2ll; suf[j]=sum; } } /* for(int i=0;i<n;i++){ cout<<pre[i]<<" "<<suf[i]<<" con "<<i<<endl; }*/ sol=l+suf[K]; for(int i=0;i<N;i++){ sol=min(sol,pre[i]+suf[i+1]); sol=min(sol,l+pre[i]+suf[i+K+1]); } //cout<<sol<<endl; return sol; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...