# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1210815 | islam_2010 | Race (IOI11_race) | C++20 | 0 ms | 0 KiB |
#pragma GCC optimize("O3")
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
int best_path(int n, int k, int h[][2], int l[]) {
int sum = 0;
int mn = INT_MAX;
int l = 0;
for (int i = 0; i < n - 1; i++) {
sum += l[i];
while (sum > k) {
sum -= l[l++];
}
if (sum == k) {
mn = min(mn, i - l + 1);
}
}
return (mn == INT_MAX ? -1 : mn);
}