# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1149963 | sasde | Race (IOI11_race) | C++17 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#define ii pair<int,int>
#define fi first
#define se second
#define int long long
#define task ""
using namespace std;
const int N = 1e6 + 10, mod = 1e9 + 7;
const int oo = 1e18;
int best_path(int N, int K, int H[][2], int L[]){
return -1;
}