Submission #19039

#TimeUsernameProblemLanguageResultExecution timeMemory
19039suhgyuho_williamGame (IOI14_game)C++98
0 / 100
0 ms18780 KiB
#include "game.h" #include <algorithm> using namespace std; int N; int a[1510][1510]; void initialize(int n) { N = n; int i,j; for(i=1; i<=N; i++){ for(j=1; j<=N; j++){ a[i][j] = -1; } } } int hasEdge(int u, int v) { int i; u++; v++; for(i=1; i<=N; i++){ if(a[u][i] == 1){ if(a[v][i] == -1) return 0; } } a[u][v] = a[v][u] = 1; return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...