Submission #1323724

#	Time	Username	Problem	Language	Result	Execution time	Memory
1323724		Trisanu_Das	Race (IOI11_race)	C++17	0 / 100	0 ms	332 KiB

race

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

int best_path(int N, int K, int H[][2], int L[]){
    int ans = N + 1;
    for(int i = 0; i < N - 1; i++){
        for(int j = i + 1; j < N - 1; j++){
            int curr = 0;
            for(int k = i; k <= j; k++) curr += L[k];
            if(curr == K) ans = min(ans, j - i);
        }
    }
    if(ans == N + 1) return -1;
    else return ans;
}

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