Submission #134535

#	Time	Username	Problem	Language	Result	Execution time	Memory
134535		20160161simone	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	2 ms	376 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define M 10000010
#define inf 0x3f3f3f
int mi[M]; 
long long delivery(int N, int K, int L, int p[]) {
    for(int i=1;i<=N;i++){
    	mi[i]=min(abs(L-p[i]),abs(p[i]))*2;	 
	}
	sort(mi+1,mi+1+N);
	int ans=0,val=0,k=0;
	for(int i=1;i<=N;i++)
	{
		k++;
		val=max(mi[i],val);
		if(k==K) 
		{
			ans+=val;
			val=0;
			k=0;
		}
	}
	ans+=val;
	return ans;
}

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