Submission #1319423

#	Time	Username	Problem	Language	Result	Execution time	Memory
1319423		nnargiz	Race (IOI11_race)	C++20	9 / 100	15 ms	1464 KiB

race

#include "race.h"

int best_path(int N, int K, int H[][2], int L[])
{
    int ans = 1e9;
    for (int i = 0; i < N - 1; i++) {
        int sum = 0, u = 0;
        for (int j = i; j < N - 1; j++) {
            sum += L[j];
            u++;
            if(sum == K) {
                if(u < ans) {
                    ans = u;
                }
                break;
            }
            if (sum > K) {
                break;
            }
        }
    }
    if (ans == 1e9) {
        ans = -1;
    }
    return ans;
}

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