Submission #119723

#	Time	Username	Problem	Language	Result	Execution time	Memory
119723		nxteru	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	2 ms	384 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000000000000
int n,k,l,m=-1;
ll x[5000005],y[5000005],q[10000005],ans=INF;
long long delivery(int N, int K, int L, int p[]) {
    n=N,k=K,l=L;
    for(int i=1;i<=n;i++){
		q[i]=p[i];
		if(m==-1&&p[i]>l/2)m=i;
	}
	q[n+1]=l;
	if(m==-1)m=n+1;
	n+=2;
    for(int i=m-1;i>=0;i-=k){
		x[0]+=q[i]*2LL;
	}
	int r=0;
	for(int i=m-2;i>=0;i--){
		x[r%k+1]-=(q[i+1]-q[i])*2LL;
		r++;
	}
	for(int i=1;i<=k;i++){
		x[i]+=x[i-1];
	}
	for(int i=m;i<n;i+=k){
		y[0]+=(l-q[i])*2LL;
	}
	r=0;
	for(int i=m+1;i<n;i++){
		y[r%k+1]-=(q[i]-q[i-1])*2LL;
		r++;
	}
	for(int i=1;i<=k;i++){
		y[i]+=y[i-1];
	}
	ans=x[0]+y[0];
	for(int i=0;i<=k;i++){
		ans=min(ans,ll(l)+x[i]+y[k-i]);
	}
	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