Submission #162563

#	Time	Username	Problem	Language	Result	Execution time	Memory
162563		MohamedAhmed04	Shortcut (IOI16_shortcut)	C++14	0 / 100	2 ms	380 KiB

shortcut

#include <bits/stdc++.h>
#include "shortcut.h"
//#include "grader.cpp"

using namespace std ;

long long find_shortcut(int n, vector<int> dist, std::vector<int>s, int c)
{
	long long pref[n+1] , suff[n+1] , distance[n+1] , Max1[n+1] , Max2[n+1] , farp[n+1] , fars[n+1] ;
	pref[1] = s[0] * 1ll;
	farp[1] = s[0] * 1ll ;
	distance[1] = 0ll ;
	for(int i = 2 ; i <= n ; ++i)
	{
		farp[i] = pref[i-1] + dist[i-2]*1ll + s[i-1] * 1ll;
		pref[i] = max(pref[i-1]+dist[i-2]*1ll , s[i-1]*1ll) ;
		distance[i] = distance[i-1] + dist[i-2] * 1ll ; 
	}
	suff[n] = s[n-1] * 1ll;
	fars[n] = s[n-1] * 1ll ;
	for(int i = n-1 ; i >= 1 ; --i)
	{
		fars[i] = suff[i+1]+dist[i-1]*1ll+s[i-1]*1ll ;
		suff[i] = max(suff[i+1]+dist[i-1]*1ll , s[i-1]*1ll) ;
	}
	long long ans = 1e18 , now = 0 , val;
	for(int i = 1 ; i <= n ; ++i)
		now = max(now , max(farp[i] , fars[i])) ;
	ans = min(ans , now) ;
	for(int i = 1 ; i <= n ; ++i)
	{
		Max1[i] = -1e18 , Max2[i] = -1e18 ;
		for(int j = i+1 ; j <= n ; ++j)
		{
			Max1[j] = Max1[j-1] ;
			Max2[j] = Max2[j-1] ;
			val = c * 1ll ;
			now = pref[i] + val + suff[j] ;
			for(int k = 1 ; k <= i ; ++k)
				now = max(now , farp[k]) ;
			for(int k = j ; k <= n ; ++k)
				now = max(now , fars[k]) ;
			for(int k = i+1 ; k < j ; ++k)
			{
				now = max(now , min(farp[k] , pref[i] + val + distance[j] - distance[k] + s[k-1] * 1ll)) ;
				now = max(now , min(fars[k] , suff[j] + val + distance[k] - distance[i] + s[k-1] * 1ll)) ;
				if(k != i+1)
				{
					long long a = Max1[j] + distance[k] + s[k-1] ;
					long long b = Max2[j] + val + distance[j] - distance[k] + s[k-1] ;
					now = max(now , min(a , b)) ;
				}
			}
			Max1[j] = max(Max1[j] , s[j-1] - distance[j]) ;
			Max2[j] = max(Max2[j] , s[j-1] + distance[j] - distance[i]) ;
			ans = min(ans , now) ;
		}
	}
    return ans ;
}

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