This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
int lft[1510] , total , ni;
void initialize (int n){
for (int i = 0 ; i < n ; i++)
lft[i] = n - 1;
total = n * (n - 1) / 2;
ni = n;
}
int hasEdge (int u , int v){
int aux;
if (u > v){
aux = u;
u = v;
v = aux;
}
total--;
lft[u]--;
lft[v]--;
if (total < ni - 1)
return 1;
if (lft[u] == 0 || lft[v] == 0){
total++;
return 1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |