Submission #69099

#TimeUsernameProblemLanguageResultExecution timeMemory
69099TuGSGeReLBoxes with souvenirs (IOI15_boxes)C++14
0 / 100
2 ms376 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; int i; vector<long long> a,b; long long delivery(int n, int k, int l, int p[]) { a.push_back(0); b.push_back(0); for(i=0;i<n;i++) a.push_back(min(p[i]*2,l)),p[i]=l-p[i]; for(i=n-1;i>=0;i--) b.push_back(min(p[i]*2,l)); for(i=0;i<=n;i++){ if(i>=k){ a[i]+=a[i-k]; b[i]+=b[i-k]; } } long long ans=1e15; for(i=0;i<n;i++)ans=min(ans,a[i]+b[n-i]); return ans; }
#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...