# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
196986 | Juney | Game (IOI14_game) | 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 "game.h"
int A[1505], N;
int G[1505][1505];
void initialize(int n) {
N = n;
memset(G, -1, sizeof(G));
}
int hasEdge(int u, int v) {
if(G[u][v] == -1) {
A[u]++; A[v]++;
if(A[u] == N-1 || A[v] == N-1) return G[u][v] = G[v][u] = 1;
else return G[u][v] = G[v][u] = 0;
}
return G[u][v];
}