# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1188778 | GoBananas69 | Race (IOI11_race) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include <array>
using namespace std;
typedef long long ll;
vector<vector<pair<int, int>>> adj;
bool check(vector<int> &pref, int m, int k) {
for (int i = 0; i<pref.size() - m; ++i) {
if (pref[i + m] - pref[i] == k) {
return true;
}
}
return false;
}
int best_path(int n, int k, vector<vector<int>> h, vector<int> s) {
return 0;
}
// int main() {
// cout << best_path(5, 5, {{0, 1}, {1, 2}, {2, 3}, {3, 4}}, {4, 1, 3, 4});
// }