#include "game.h"
int n,par[1500],rnk[1500],amari[1500],ok[1500][1500];
void initialize(int _n) {
n = _n;
for(int i = 0;i < n;i++){
par[i] = i;
rnk[i] = 0;
amari[i] = n - 1;
}
}
int find(int x){
if(x == par[x]) return x;
return par[x] = find(par[x]);
}
void unite(int x,int y){
x = find(x);
y = find(y);
int tmp = amari[x] + amari[y] - 2;
if(rnk[x] < rnk[y]) par[x] = y;
else{
par[y] = x;
if(rnk[x] == rnk[y]) rnk[x]++;
}
amari[find(x)] = tmp;
}
bool same(int x,int y){
return find(x) == find(y);
}
int hasEdge(int u, int v) {
if(n > 80) return 1;
int x = find(u),y = find(v);
if(x == y){
ok[u][v] = 1;
ok[v][u] = 1;
return 1;
}
int cnt = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
if(find(i) == x && find(j) == y && !ok[i][j]) cnt++;
}
}
if(cnt == 1){
ok[u][v] = 1;
ok[v][u] = 1;
unite(u,v);
return 1;
}
ok[u][v] = -1;
ok[v][u] = -1;
return 0;
}
