# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674249 | Megumin2006 | Race (IOI11_race) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ed '\n'
#define pb push_back
#define int long long
#define ii pair<int,int>
#define fi first
#define se second
using namespace std;
int best_path(int N, int K, int H[][2], int L[]) {
return 1;
}