제출 #444867

#제출 시각아이디문제언어결과실행 시간메모리
444867osmanallazov선물상자 (IOI15_boxes)C++14
100 / 100
566 ms199628 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int p[]) { long long pref[N]; long long suff[N]; for(int i=0;i<N;i++){ if(i<K){ pref[i]=min(L,p[i]*2); } else{ pref[i]=min(L,p[i]*2)+pref[i-K]; } } for(int i=N-1;i>=0;i--){ if(N-i-1<K){ suff[i]=min(2*(L-p[i]),L); } else{ suff[i]=min(2*(L-p[i]),L)+suff[K+i]; } } long long res=min(pref[N-1],suff[0]); for(int i=0;i<N-1;i++){ res=min(res,pref[i]+suff[i+1]); } return res; }
#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...