Submission #28836

#	Time	Username	Problem	Language	Result	Execution time	Memory
28836		aybala	Race (IOI11_race)	C++11	0 / 100	2 ms	248 KiB

race

#include "race.h"

int best_path(int N, int K, int H[][2], int L[])
{
	int i,j,k;
	int ans=N+1;
	for(i=0;i<N;i++){
		for(j=i+1;j<N;j++){
			long long x=0;
			for(k=i;k<j;k++){
				x+=(long long)L[k];
			}
			if(x==K && ans>j-i+1)
				ans=j-i;
		}
	}
	if(ans==N+1)
		ans=-1;
	N=ans;
	return N;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57