Submission #445130

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

boxes

#include<bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int l, int p[]) {
	long long pref[n], suf[n];
	for(int i = 0;i<n;i++) {
		if(i >= k)pref[i] = pref[i-k] + min(p[i]*2, l);
		else pref[i] = min(p[i]*2, l);
	}
	for(int i = n - 1;i>=0;i--) {
		if(n - i - 1 >= k) {
			suf[i] = min(l, 2*(l - p[i])) + suf[i+k];
		}
		else {
			suf[i] = min(l, 2*(l - p[i])); 
		}
	}
	long long ans = min(suf[0], pref[n-1]);
	for(int i = 0;i<n-1;i++) {
		ans = min(ans, pref[i]+suf[i+1]);
	}
	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