제출 #344935

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll ans=0;
long long delivery(int N, int K, int L, int p[]) {
	
	vector<ll>xd;
	for(ll i=0;i<N;i++)xd.push_back(p[i]);
	ll l=0,r=N-1;
	for(;l<N;l+=K)
	{
		ll t=min((ll)N-1,l+K-1);
		if(xd[t]>L-xd[t])
		{
			break;
		}
		//cout<<"left "<<xd[t]<<endl;
		ans+=2*xd[t];
	}
	for(;r>=0&&r>=l;r-=K)
	{
		ll t=max((ll)l,r-K+1);
		if(xd[t]<L-xd[t])
		{
			break;
		}
		//cout<<"right "<<xd[t]<<endl;
		ans+=2*(L-xd[t]);
	}
	ll L1=l;
	ll R1=r;
	ans+=L*max(0ll,(ll)(R1-L1+K)/K);
    return ans;
}

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