Submission #444523

#	Time	Username	Problem	Language	Result	Execution time	Memory
444523		Khizri	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	2087 ms	332 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 funk(int n,int k,int dis,int arr[],int l,int r){
	//cout<<l<<' '<<r<<endl;
	if(r-l<=k){
		//cout<<min(arr[l],dis-arr[l])*2ll<<endl;
		return min(arr[r],dis-arr[l])*2ll;
	}
	ll ans=INF;
	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 ans;
}
long long delivery(int n, int k, int l, int arr[]) {
    ll ans=0;
	sort(arr,arr+n);
	ans=funk(n,k,l,arr,0,n-1);
	return ans;
}

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