Submission #351856

#	Time	Username	Problem	Language	Result	Execution time	Memory
351856		Kerim	Shortcut (IOI16_shortcut)	C++17	23 / 100	2083 ms	512 KiB

shortcut

#include "shortcut.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const ll B=1e18;
long long find_shortcut(int n,vector<int> l,vector<int>d, int c){
	vector<ll>x(n);
	for(int i=0;i<n-1;i++)
		x[i+1]=x[i]+l[i];
	ll ans=B;
	for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++){
			ll res=0;
			for(int a=0;a<n;a++)
				for(int b=a+1;b<n;b++)
					umax(res,d[a]+d[b]+min(x[b]-x[a],abs(x[a]-x[i])+abs(x[b]-x[j])+c));
			umin(ans,res);
		}
    return ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 14 / 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