Submission #132940

#	Time	Username	Problem	Language	Result	Execution time	Memory
132940		StevenH	Race (IOI11_race)	C++14	0 / 100	29 ms	380 KiB

race

#include "race.h"

int m,len;


int best_path(int N, int K, int H[][2], int L[])
{

	m=N-1;
	int k,res;
	int ans=N+1;
	for(int i=0;i<m;i++)
	{
		k=1;
		res=L[i];
		while(res<K)
		{
			k++;
			res+=L[i+k];
		}
		if(res==K)
		{
			if(k<ans)ans=k;
		}
	}
	
	if(ans==N+1)return -1;
	return ans;
}

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