This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#ifndef _GAME_H
#define _GAME_H
#include<bits/stdc++.h>
std::bitset<1500>d[1510],ac,ant;
int N;
void initialize(int n)
{
N=n;
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
d[i][j]=1;
}
}
int hasEdge(int u, int v)
{
d[u][v]=d[v][u]=0;
ac=d[u];
ant=d[v];
while(ant!=ac)
{
ant=ac;
for(int i=0;i<N;++i)
if(ac[i])
ac|=d[i];
}
if(ac[v])
return 0;
d[u][v]=d[v][u]=1;
return 1;
}
#endif
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |