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"
#include <bits/stdc++.h>
using namespace std;
int deg[2000];
void initialize(int n) {
for (int i = 0; i < n; i++) deg[i] = n-1;
}
int hasEdge(int u, int v) {
// assert that query are unique
deg[u]--; deg[v]--;
if (!deg[u] and !deg[v]) return 0;
if (deg[v] == 0) swap(u, v);
if (deg[u] == 0) {
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... |