#include "race.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF=1e9;
int best_path(int N, int K, int H[][2], int L[])
{
ll p[N+1];
p[0]=0;
for(int i=1;i<=N;i++){
p[i]=p[i-1]+L[i-1];
}
int res=INF;
for(int l=0,r=1;r<=N;r++){
while(l+1<=r&&p[r]-p[l+1]>=K){
l++;
}
if(p[r]-p[l]==K){
res=min(res,r-l);
}
}
return (res==INF?-1:res);
}
# | 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... |