# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428320 | Rouge_Hugo | Game (IOI14_game) | C++14 | 1 ms | 204 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<bits/stdc++.h>
#include "game.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
int n;
const int N=100;
int pa[N],sz[N],vis[N][N];
vector<int>v[N];
void merge(int x,int y)
{
if(sz[x]<sz[y])swap(x,y);
for(auto it:v[y])
{
pa[it]=x;
v[x].pb(it);
sz[x]++;
}
v[y].clear();
}
void initialize(int N) {
n=N;
for(int i=0;i<n;i++)
{
v[i].pb(i);
pa[i]=i;
sz[i]=1;
}
}
int hasEdge(int x, int y) {
if(pa[x]==pa[y])return 1;
int xx=x,yy=y;
x=pa[x];y=pa[y];int r=0,rr=0;
for(auto it:v[x])
{
for(int i=0;i<n;i++)
{
int u=pa[i];
if(u==x)continue;
if(vis[it][i])continue;
if(i==y)continue;
r=1;break;
}
}
for(auto it:v[y])
{
for(int i=0;i<n;i++)
{
int u=pa[i];
if(u==y)continue;
if(vis[it][i])continue;
if(i==x)continue;
rr=1;
}
}
if(r>0&&rr>0)
{
vis[x][y]=1;
vis[y][x]=1;
return 0;
}
merge(x,y);
return 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |