Submission #444828

#	Time	Username	Problem	Language	Result	Execution time	Memory
444828		Khizri	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	1 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"
const int mxn=1e7+5;
ll l[mxn],r[mxn];
long long delivery(int n, int k, int dis, int arr[]) {
    ll ans=INF;
    for(int i=0;i<n;i++){
    	if(i<k){
    		l[i]=min(1ll*dis,arr[i]*2ll);
		}
		else{
			l[i]=l[(i/k)*k-1]+min(1ll*dis,arr[i]*2ll);
		}
	}
	int say=0,ind=0;
    for(int i=n-1;i>=0;i--){
    	say++;
    	if(say<=k){
    		r[i]=min(1ll*dis,(dis-arr[i])*2ll);
		}
		else{
			r[i]=r[ind]+min(1ll*dis,(dis-arr[i])*2ll);
		}
		if(say%k==0){
    		ind=i;
		}
	}
	ans=r[0];
    for(int i=0;i<=n-1;i++){
    	ans=min(l[i]+r[i+1],ans);
	}
	return ans;
}

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