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;
const int MxN = 1510;
int n, p[MxN], deg[MxN];
int find_set(int u) {
if (p[u] == u) return u;
return p[u] = find_set(p[u]);
}
void union_set(int u, int v) {
u = find_set(u);
v = find_set(v);
if (u != v) {
deg[u] += deg[v];
p[v] = u;
}
}
void initialize(int N) {
n = N;
for (int i = 0; i < n; i++) deg[i] = n - 1;
iota(p, p + n, 0);
}
int hasEdge(int u, int v) {
deg[u]--, deg[v]--;
return (deg[u] == 0 || deg[v] == 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... |