# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856230 | Hakiers | 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;
const int MAXN = 2e3 + 7;
bool edge[MAXN][MAXN];
int deg[MAXN];
int hasEdge(int u, int v){
if(!edge[u][v]){
if(min(deg[v], deg[u]) == 1)
return 1;
deg[u]--;
deg[v]--;
edge[u][v] = edge[v][u] = 1;
return 0;
}
else{
return 0;
}
void initg(int n){
for(int i = 1; i <= n; i++)
deg[i] = n-1;
}
void initialize(int n){
initg(n);
}