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"
const int N = 1501;
int deg[N];
int q = 0;
void initialize(int n) {
for(int i = 0;i < n;i++)deg[i] = n-2;
}
int hasEdge(int u, int v) {
q++;
if(q == 1)
return 0;
deg[u]--;
deg[v]--;
if(!deg[u] or !deg[v]){
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... |