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 <bits/stdc++.h>
#include "game.h"
using namespace std;
const int maxn = 1e3 + 5e2 + 2;
int queries[maxn];
void initialize(int n) {
for (int i = 0; i < n; i++){
queries[i] = i;
}
}
int hasEdge(int u, int v) {
if (u < v) swap(u,v);
queries[u]--;
return !queries[u];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |