# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
513724 | status_coding | Game (IOI14_game) | C++14 | 0 ms | 0 KiB |
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>
int n;
int par[2005];
int nr[2005][2005];
int dsu_par(int x)
{
if(par[x]!=x)
par[x]=dsu_par(par[x]);
return par[x];
}
void dsu_merge(int x, int y)
{
par[y]=x;
for(int i=1;i<=n;i++)
{
nr[x][i] += nr[y][i];
nr[i][x] = nr[x][i];
}
}
void initialize(int N)
{
n = N;
for(int i=1;i<=n;i++)
{
par[i]=i;
for(int j=1;j<=n;j++)
nr[i][j]=1;
}
}
int hasEdge(int x, int y)
{
x = dsu_par(x+1);
y = dsu_par(y+1);
if(x == y)
return true;
if(cnt[x][y] == 1)
{
dsu_merge(x, y);
return true;
}
nr[x]--;
nr[y]--;
return false;