Submission #206438

#	Time	Username	Problem	Language	Result	Execution time	Memory
206438		autumn_eel	Shortcut (IOI16_shortcut)	C++14	38 / 100	492 ms	888 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;

ll L[5000],L2[5000],R[5000],R2[5000];
ll sum[5000];

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
	memset(L,0,sizeof(L));
	memset(L2,0,sizeof(L2));
	memset(R,0,sizeof(R));
	memset(R2,0,sizeof(R2));
	assert(n<=500);
	rep(i,n){
		if(i){
			L[i]=L[i-1]+l[i-1];
			L2[i]=max(L2[i-1],L[i]+d[i]);
		}
		L[i]=max(L[i],(ll)d[i]);
		L2[i]=max(L2[i],(ll)d[i]);
	}
	for(int i=n-1;i>=0;i--){
		if(i<n-1){
			R[i]=R[i+1]+l[i];
			R2[i]=max(R2[i+1],R[i]+d[i]);
		}
		R[i]=max(R[i],(ll)d[i]);
		R2[i]=max(R2[i],(ll)d[i]);
	}
	rep(i,n-1)sum[i+1]=sum[i]+l[i];
	ll Min=L2[n-1];
	rep(i,n)for(int j=i+1;j<n;j++){
		ll Max=max({L2[i],R2[j],L[i]+c+R[j]});
		for(int k=i+1;k<j;k++){
			Max=max(Max,L[i]+min(c+(sum[j]-sum[k]),sum[k]-sum[i])+d[k]);
			Max=max(Max,R[j]+min(c+(sum[k]-sum[i]),sum[j]-sum[k])+d[k]);
		}
		int s=i+1;
		ll M=LLONG_MIN;
		deque<pair<ll,int>>que;//slide max
		for(int k=i+1;k<j;k++){
			while(s<k&&(sum[j]-sum[k])+c+(sum[s]-sum[i])<=(sum[k]-sum[s])){
				M=max(M,c+(sum[s]-sum[i])+d[s]);
				if(!que.empty()&&que.front().second==s)que.pop_front();
				s++;
			}
			Max=max(Max,M+d[k]+(sum[j]-sum[k]));
			if(!que.empty())Max=max(Max,que.front().first+sum[k]+d[k]);
			ll val=d[k]-sum[k];
			while(!que.empty()&&que.back().first<val)que.pop_back();
			que.push_back({val,k});
		}
		Min=min(Min,Max);
	}
    return Min;
}

• Subtask 1: 9 / 9
• Subtask 2: 14 / 14
• Subtask 3: 8 / 8
• Subtask 4: 7 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3