Submission #736567

#TimeUsernameProblemLanguageResultExecution timeMemory
736567ngano_upat_naGame (IOI14_game)C++17
0 / 100
1 ms212 KiB
#include "bits/stdc++.h" #include "game.h" using namespace std; const int N = 1500; bool graph[N][N]; void initialize(int n) { for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { if (i == j-1) { graph[i][j] = true; } else { graph[i][j] = false; } } } } int hasEdge(int u, int v) { if (graph[u][v]) { return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...