제출 #430884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430884		KalasLavas	선물상자 (IOI15_boxes)	C++14	25 / 100	1 ms	204 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
#define F first
#define S second
using ll = long long;
using pii= pair<int,int>;
using pll= pair<ll,ll>;
int n,k,len,*p;
ll ans;
ll delivery(int _N, int _K, int _L, int _p[])
{
	n=_N; k=_K; len=_L; p=_p;
	int l=-1, r=n;
	while(l+1<n and (p[l+1]<<1)<len) l++;
	r = l+1;
	while(0<=l and r<n and ((p[r]-p[l])<<1)<=len)
	{
		int kk = k;
		ans+=len;
		while(kk--)
		{
			if(l==-1 and r==n) break;
			if(r==n or (0<=l and p[l]>(len-p[r]))) l--;
			else r++;
		}
	}
	//cerr<<l<<' '<<r<<endl;
	//cerr<<ans<<endl;
	while(0<=l)
	{
		ans+=p[l]<<1;
		l-=k;
	}
	//cerr<<ans<<endl;
	while(r<n)
	{
		ans+=(len-p[r])<<1;
		r+=k;
	}
	return ans;
}
/*
4 8 8
3 4 5 6

4 8 9
3 4 5 6

3 2 8
1 2 5
*/

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