# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128379 | SoSooding | 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 "game.h"
#include <bits/stdc++.h>
const int N = 1501;
int deg[N];
void initialize(int n) {
for(int i = 0;i < n;i++)deg[i] = n-1;
}
int hasEdge(int u, int v) {
int mx = max(u, v);
deg[u]++;
if(deg[u] == u)
return 1;
return 0;
}