제출 #736603

#제출 시각아이디문제언어결과실행 시간메모리
736603ngano_upat_na게임 (IOI14_game)C++17
0 / 100
2 ms312 KiB
#include "bits/stdc++.h" #include "game.h" using namespace std; int ct, N; bool graph[1500][1500]; void initialize(int n) { ct = n * (n - 1) / 2; N = n; for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { graph[i][j] = false; } } for (int i=0; i<n-2; i++) { graph[i][i+1] = true; graph[i+1][i] = true; } } int hasEdge(int u, int v) { ct--; if (graph[u][v] || ct == 0) { return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...