# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006462 | devariaota | Game (IOI14_game) | C++17 | 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>
using namespace std;
int n, f[N];
void initialize(int n) {
}
int hasEdge(int u, int v) {
f[max(u, v)]++;
return f[max(u, v)] == max(u, v);
}