Submission #719307

#	Time	Username	Problem	Language	Result	Execution time	Memory
719307		XJP12	Race (IOI11_race)	C++14	9 / 100	3068 ms	1436 KiB

race

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
ll sum=0;
int opt;
int len=0;
int best_path(int n, int k, int h[][2], int l[]){
	opt=n+1;
	for(int i=0; i<n-1; i++){
		sum=0;
		len=0;
		for(int j=i; j<n-1; j++){
			sum+=l[j];
			len++;
		//	cout<<len<<endl;
			//cout<<sum<<" "<<len<<" "<<j<<endl;
			if(sum==k) {opt=min(opt,len);
			break;}
		}
	}
	if(opt>n) opt=-1;
	return opt;
}

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