Submission #305850

#	Time	Username	Problem	Language	Result	Execution time	Memory
305850		jlallas384	Race (IOI11_race)	C++14	0 / 100	1 ms	256 KiB

race

#include "race.h"

int best_path(int N, int K, int H[][2], int L[]){
    int ans = 999999;
    for(int i = 0; i < N; i++){
        int len = 0;
        int cur = 0;
        for(int j = i; j < N && cur < K; j++){
            len++;
            cur+=L[j];
        }
        if(len < ans && cur == K){
            ans = len;
        }
    }
    return ans;
}

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