Submission #1015960

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015960		Muhammet	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	882 ms	294232 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
 
#define N 10000005
#define ll long long
#define ff first
#define ss second
 
using namespace std;

ll p[N], s[N];

ll delivery(int n, int k1, int l1, int a[]) {
	sort(a,a+n);
	ll x = l1, k = k1;
	for(int i = 0; i < n; i++){
		p[i+1] = a[i] + p[max(i-k+1,0ll)];
	}
	for(int i = n-1; i >= 0; i--){
		s[i+1] = (x-a[i]) + s[min(i+k+1,(ll)(n+1))];
	}
	ll ans = LLONG_MAX;
	for(ll i = 0; i <= n; i++){
		for(ll j = 0; j <= 10; j++){
			ll z = min(i+k*j+1,(ll)(n+1));
			ans = min(ans, 2*(p[i] + s[z] )+ (((z-i-2+k)/k)*x));
		}
	}
	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