Submission #107488

#	Time	Username	Problem	Language	Result	Execution time	Memory
107488		pedro_sponchiado	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	531 ms	196600 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=10000010;
long long int l[maxn], r[maxn];

long long int delivery(int n, int cap, int tam, int pos[]){
	
	for(int i=1; i<=n; i++){
		l[i]=2*pos[i-1];
		if(i>=cap+1) l[i]+=l[i-cap];		
	}
	for(int i=1; i<=n; i++){
		r[i]=2*(tam-pos[n-i]);
		if(i>=cap+1) r[i]+=r[i-cap];	
	}
	long long int resp=1123456789123456789;
	for(int i=0; i<=n; i++){
		resp=min(resp, l[i]+r[n-i]);
		if(n-cap-i>=0) resp=min(resp, l[i]+r[n-cap-i]+tam);
	}
	return resp;
}

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