# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1016819 | vivkostov | 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<bits/stdc++.h>
#define endl '\n'
#include "game.h"
using namespace std;
int br[2005][2005],n;
void initialize()
{
n=N;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
br[i][j]=1;
}
}
}
int hasEdge(int u,int v)
{
int h=0;
for(int i=1;i<=n;i++)
{
br[i][u]++;
br[i][v]++;
if(br[i][u]==n-1||br[i][v]==n-1)h=1;
}
if(h)return 1;
return 0;
}