Submission #1323729

#	Time	Username	Problem	Language	Result	Execution time	Memory
1323729		Trisanu_Das	Race (IOI11_race)	C++17	9 / 100	3092 ms	1528 KiB

race

#include "race.h"
#include <bits/stdc++.h>
using namespace std;

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

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