Submission #1352631

#	Time	Username	Problem	Language	Result	Execution time	Memory
1352631		afterzero	Race (IOI11_race)	C++20	9 / 100	1876 ms	1720 KiB

race

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

int best_path(int N, int K, int H[][2], int L[]){


vector<int>ji;

for(int i = 0 ; i< N ; i++){
        int sum = 0 ;
        int cnt = 0 ;
        for(int j = i ; j < N- 1 ; j++){

    sum+=L[j];
    cnt ++;

    if(sum==K){
       ji.push_back(cnt);
       

    }






        }
}


if(!ji.empty()){
    return *min_element(ji.begin(),ji.end());
}else{
return -1 ;
}











}

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