Submission #209368

#	Time	Username	Problem	Language	Result	Execution time	Memory
209368		autumn_eel	Boxes with souvenirs (IOI15_boxes)	C++14	50 / 100	2098 ms	4216 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;

const ll INF=0x3f3f3f3f3f3f3f3f;

//~ ll s1[10000100],s2[10000100];

long long delivery(int N, int K, int L, int p[]) {
	ll Min=INF;
	for(int i=0;i<=N;i++){
		//[0,i) [i,N)
		int cnt=0;
		ll sum=0;
		for(int j=i-1;j>=0;j--){
			if(cnt==0)sum+=min(p[j],L-p[j]);
			else sum+=p[j+1]-p[j];
			cnt++;
			if(cnt==K||j==0){
				sum+=min(p[j],L-p[j]);
				cnt=0;
			}
		}
		for(int j=i;j<N;j++){
			if(cnt==0)sum+=min(p[j],L-p[j]);
			else sum+=p[j]-p[j-1];
			cnt++;
			if(cnt==K||j==N-1){
				sum+=min(p[j],L-p[j]);
				cnt=0;
			}
		}
		Min=min(Min,sum);
	}
	return Min;
}

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