Submission #1352628

#	Time	Username	Problem	Language	Result	Execution time	Memory
1352628		afterzero	Race (IOI11_race)	C++20	0 / 100	0 ms	344 KiB

race

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

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


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

    sum+=L[j];

    if(sum==K){
        m = sum ;
        break;
    }






        }
}


return m ;











}

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