Submission #1199625

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

race

#include "race.h"
#include <bits/stdc++.h>

int best_path(int N, int K, int H[][2], int L[])
{
    long long sum=0;
    int j =0;
    long long rez=1e18;
    int c=0;
    for(int i = 0; i < N-1; i++)
    {
        sum+=L[i];
        while(sum > K)
        {
            sum-=L[j];
            j++;
        }
        if(sum==K)
        {
            c=1;
            if(i-j+1 < rez) rez = i-j+1;
        }
    }
    if(c==0) return -1;
    return rez;
}

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