Submission #1199604

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

race

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

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

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