Submission #1352626

#	Time	Username	Problem	Language	Result	Execution time	Memory
1352626		afterzero	Race (IOI11_race)	C++20	9 / 100	11 ms	1344 KiB

race

#include <vector>
#include <algorithm>
#include <climits>

int best_path(int N, int K, int H[][2], int L[]) {
    int mi = INT_MAX;
    bool found = false;

   
    for (int i = 0; i < N; i++) {
        long long csum = 0;
        int ecount = 0;

       
        for (int j = i; j < N - 1; j++) {
            csum += L[j];
            ecount++;

           
            if (csum == K) {
                mi = std::min(mi, ecount);
                found = true;
            }
           
            if (csum > K) {
                break;
            }
        }
    }

    return found ? mi : -1;
}

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