Submission #47617

#	Time	Username	Problem	Language	Result	Execution time	Memory
47617		RezwanArefin01	Boxes with souvenirs (IOI15_boxes)	C++11	100 / 100	510 ms	196176 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h> 
using namespace std;

typedef long long ll; 

ll delivery(int n, int k, int L, int p[]) {
	ll l[n + 1], r[n + 1];
	l[0] = r[0] = 0; 
	for(int i = 1; i <= n; i++) {
		l[i] = 2ll * p[i - 1] + (i - k >= 0 ? l[i - k] : 0); 
		r[i] = 2ll * (L - p[n - i]) + (i - k >= 0 ? r[i - k] : 0);
	}  
	ll mn = 1e18;
	for(int i = 0; i <= n; i++) {
		mn = min(mn, l[i] + r[n - i]); 
		if(n - k - i >= 0) 
			mn = min(mn, l[i] + r[n - k - i] + L); 
	}
	return mn; 
}

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