Submission #1199595

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199595		ricardsjansons	Race (IOI11_race)	C++20	0 / 100	0 ms	328 KiB

race

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

const int INF=1e9;

int best_path(int N, int K, int H[][2], int L[])
{
    int 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(p[r]-p[l]>K){
            l++;
        }
        if(p[r]-p[l]==K){
            res=min(res,r-l);
        }
    }
    return (res==INF?-1:res);
}

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