제출 #384884

#제출 시각아이디문제언어결과실행 시간메모리
384884Drew_게임 (IOI14_game)C++14
0 / 100
1 ms364 KiB
#include "game.h" #include <assert.h> #include <iostream> using namespace std; const int MAX = 1507; int node = 0; int ctr = 0; int edge = 0; int fq[MAX] = {}; void initialize(int n) { node = n; } int hasEdge(int u, int v) { ctr++; fq[u]++, fq[v]++; if (fq[u] == node-1 || fq[v] == node-1) { edge++; return 1; } /* if (ctr-1 + node - 1 - edge == node * (node - 1) / 2) { edge++; return 1; } */ return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...