Submission #196988

#TimeUsernameProblemLanguageResultExecution timeMemory
196988JuneyGame (IOI14_game)C++14
0 / 100
10 ms9208 KiB
#include "game.h" #include <cstring> int A[1505], N; int G[1505][1505]; void initialize(int n) { N = n; memset(G, -1, sizeof(G)); memset(A, 0, sizeof(A)); } 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]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...