제출 #59173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
59173		TadijaSebez	Boxes with souvenirs (IOI15_boxes)	C++11	100 / 100	513 ms	235340 KiB

boxes

#include <stdio.h>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
const int N=10000050;
const ll inf=1e18;
ll l[N],r[N];
ll min(ll a, ll b){ return a>b?b:a;}
ll max(ll a, ll b){ return a>b?a:b;}
int x[N];
ll delivery(int n, int k, int sz, int v[])
{
	int i;
	//scanf("%i %i %i",&n,&k,&sz);
	for(i=1;i<=n;i++) x[i]=v[i-1];//scanf("%i",&x[i]);
	for(i=1;i<=n;i++) l[i]=l[max(i-k,0)]+(ll)2*x[i];
	for(i=n;i>=1;i--) r[i]=r[min(i+k,n+1)]+(ll)2*(sz-x[i]);
	ll sol=inf;
	if(n<=k) sol=sz;
	for(i=0;i<=n;i++) sol=min(sol,l[i]+r[i+1]);
	for(i=0;i<=n;i++) sol=min(sol,l[i]+r[min(i+k+1,n+1)]+sz);
	//printf("%lld\n",sol);
	return sol;
}

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