Submission #209361

#	Time	Username	Problem	Language	Result	Execution time	Memory
209361		autumn_eel	선물상자 (IOI15_boxes)	C++14	0 / 100	5 ms	504 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;

ll solve(int N,int K,int L,int p[],int s){
	ll res=0;
	int cnt=0;
	while(s<N){
		cnt++;
		assert(cnt==1);
		int g=min(N-1,s+K-1);
		res+=min(p[s],L-p[s]);res+=min(p[g],L-p[g]);res+=abs(p[s]-p[g]);
		s=g+1;
	}
	return res;
}

long long delivery(int N, int K, int L, int p[]) {
	int s=0;
	while(s<N&&p[s]==0)s++;
	ll res1=solve(N,K,L,p,s);
	return res1;
	for(int i=s;i<N;i++)p[i]=L-p[i];
	reverse(p+s,p+N);
	ll res2=solve(N,K,L,p,s);
	return min(res1,res2);
}

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