Submission #1199620

#TimeUsernameProblemLanguageResultExecution timeMemory
1199620lizaRace (IOI11_race)C++20
0 / 100
1 ms328 KiB
#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;
    for(int i = 0; i < N-1; i++)
    {
        sum+=L[i];
        while(sum > K)
        {
            sum-=L[j];
            j++;
        }
        if(sum==K)
        {
            if(i-j < rez) rez = i-j+1;
           // rez=min(rez, i-j);
        }
    }
    if(rez==1e18) return 1;
    return rez;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...