#include "race.h"
#include <iostream>
using namespace std;
int best_path(int N, int K, int H[][2], int L[]) {
int current = 0;
int currentPaths = 0;
int best = 0;
for(int i = 0; i < N; i++) {
while (current > K) {
current -= L[i-currentPaths];
currentPaths--;
}
if(current == K) {
best = min(best,currentPaths);
current -= L[i-currentPaths];
currentPaths--;
}
current += L[i];
currentPaths++;
if (current == K) {
best = min(best, currentPaths);
}
}
return (best==0) ? -1 : best;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |