Submission #445142

#	Time	Username	Problem	Language	Result	Execution time	Memory
445142		fuad27	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	517 ms	196188 KiB

boxes

#include<iostream>
using namespace std;typedef long long L;L delivery(int n,int k,int l,int p[]){L pref[n],suf[n];for(L i=0;i<n;i++){(i>=k)?pref[i]=pref[i-k]+min(p[i]*2,l):pref[i]=min(p[i]*2,l);L j=n-i-1;(n-j-1>=k)?suf[j]=min(l,2*(l-p[j]))+suf[j+k]:suf[j]=min(l,2*(l-p[j]));}L ans=min(suf[0],pref[n-1]);for(L i=1;i<n;i++)ans=min(ans,pref[i-1]+suf[i]);return ans;}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30