#include "bits/stdc++.h"
#include "game.h"
using namespace std;
const int sz = 2e3 + 9;
int used[sz];
int TIME = 0;
int cnt = 0;
bool v[sz][sz];
int n;
void dfs(int node)
{
    used[node] = TIME;
    ++cnt;
    for (int i = 0; i < n; ++i)
    {
        if (!v[node][i] && used[i] != TIME)
        {
            dfs(i);
        }
    }
}
void initialize(int __n)
{
    n = __n;
    cnt = 0;
    TIME = 0;
    memset(used, 0, sizeof(used));
    return;
}
int hasEdge(int x, int y)
{
    v[x][y] = v[y][x] = 1;
    TIME++;
    cnt = 0;
    dfs(0);
    if (cnt != n)
    {
        v[x][y] = v[y][x] = 0;
    }
    return !v[x][y];
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |