Submission #444572

#	Time	Username	Problem	Language	Result	Execution time	Memory
444572		Khizri	선물상자 (IOI15_boxes)	C++17	35 / 100	2092 ms	8268 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
ll dp[1005][1005];
ll funk(int n,int k,ll dis,int arr[],int l,int r){
	if(l>r||l<0||r<0||r>=n||l>=n){
		return 0;
	}
	//cout<<l<<' '<<r<<endl;
	ll ans=INF;
	if(dp[l][r]!=-1){
		return dp[l][r];
	}
	if(l==r){
		return dp[l][r]=min(min(1ll*arr[l],1ll*(dis-arr[l]))*2ll,dis);
	}
	if(r-l+1<=k){
		//cout<<min(arr[l],dis-arr[l])*2ll<<endl;
		ans=min(min(1ll*arr[r],1ll*(dis-arr[l]))*2ll,dis);
	}
	for(int i=l;i<=r;i++){
		if(i+1<=r){
			ans=min(ans,funk(n,k,dis,arr,l,i)+funk(n,k,dis,arr,i+1,r));
		}
	}
	//cout<<ans<<endl;
	return dp[l][r]=ans;
}
long long delivery(int n, int k, int l, int arr[]) {
    ll ans=0;
    if(k==1){
    	for(int i=0;i<n;i++){
    		ans+=min(arr[i],l-arr[i])*2;
		}
		return ans;
	}
	if(k==n){
		sort(arr,arr+n);
		ans=min({arr[n-1]*2,(l-arr[0])*2,l});
		//arr[n]=l;
		for(int i=0;i<n;i++){
			if(i+1<n){
				ans=min(ans,arr[i]*2ll+(l-arr[i+1])*2ll);
			}
		}
		return ans;
	}
	sort(arr,arr+n);
	memset(dp,-1,sizeof(dp));
	ans=funk(n,k,l,arr,0,n-1);
	return ans;
}

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