| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1323726 | Trisanu_Das | Race (IOI11_race) | C++17 | 0 ms | 0 KiB |
#include "race.h"
#include <bits/stdc++.h>
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; j++){
int cur = 0;
for(int k = i; k < j; k++) cur += L[k];
if(x == K) ans = min(ans, j - i);
}
}
if(ans == N + 1) return -1;
return ans;
}
