제출 #18492

#제출 시각아이디문제언어결과실행 시간메모리
18492eaststarBoxes with souvenirs (IOI15_boxes)C++14
100 / 100
710 ms196172 KiB
#include "boxes.h" #include <algorithm> using namespace std; long long D[10000010],E[10000010],ans; long long delivery(int n,int k,int l,int a[]){ int i; sort(a,a+n); for(i=0;i<n;++i)D[i]=(i<k?0:D[i-k])+min(a[i]*2,l); for(;i--;)E[i]=(i<n-k?E[i+k]:0)+min((l-a[i])*2,l); ans=E[0]; for(i=0;i<n;++i)ans=min(ans,D[i]+E[i+1]); 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...