Submission #1189926

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189926		GoBananas69	Race (IOI11_race)	C++20	9 / 100	15 ms	1352 KiB

race

#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <string>
#include <cmath>
using namespace std;

typedef long long ll;

int best_path(int n_, int k_, int h[][2], int l[]) {
    int n = n_;
    int k = k_;
    int res = 1e9;
    for (int i = 0; i<n; ++i) {
        int sum = 0;
        for (int j = i; j<n; ++j) {
            sum += l[j];
            if (sum > k) break;
            else if (sum == k) res = min(res, j - i + 1);
        }
    }
    return (res == 1e9 ? -1 : res);
}

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