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"
using namespace std;
int n, c;
vector< unordered_set<int> > g;
vector<int> vis;
void initialize(int N){
n = N;
g.resize(n);
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++) if(i != j)
g[i].insert(j);
}
void dfs(int u){
if(vis[u]) return;
vis[u] = 1, c++;
for(int v : g[u]) dfs(v);
}
int hasEdge(int u, int v) {
if(!g[u].count(v)) return 0;
g[u].erase(v), g[v].erase(u);
vis.assign(n, 0), c = 0;
dfs(0);
if(c < n) g[u].insert(v), g[v].insert(u);
return c < n;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |