Submission #139450

#	Time	Username	Problem	Language	Result	Execution time	Memory
139450		reda	Race (IOI11_race)	C++14	9 / 100	3006 ms	3164 KiB

race

#include "race.h"
#include <iostream>

using namespace std;


int best_path(int n, int K, int H[][2], int L[])
{
    int sum[n+1];
    int ans=-1;
	for(int i=0;i<n+1;i++)sum[i]=0;
	for(int i=0;i<n-1;i++)
	{
		sum[i]+=L[i];
		sum[i+1]+=sum[i];
	}
	for(int i=0;i<n-1;i++)
	for(int j=i;j<n-1;j++)
	{
		if(i==0)
		{
			if(sum[j]==K&&(j-i+1<ans||ans==-1))ans=j-i+1;
		}
		else if(sum[j]-sum[i-1]==K&&(j-i+1<ans||ans==-1))ans=j-i+1;
	}

	return ans;
}

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