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 "game.h"
# include <bits/stdc++.h>
using namespace std;
const int N = 1502;
int g[N][N], n, used[N];
void initialize(int N) {
n = N;
}
void dfs(int v){
used[v] = 1;
for(int i = 1; i <= n; i ++){
if(!used[i] && !g[i][v]){
dfs(i);
}
}
}
bool ok(){
memset(used, 0, sizeof(used));
dfs(1);
for(int i = 1; i <= n; i ++){
if(!used[i]) return 0;
}
return 1;
}
int hasEdge(int u, int v) {
u ++, v ++;
g[u][v] = 1;
g[v][u] = 1;
if(ok()){
return 0;
} else {
g[u][v] = 0;
g[v][u] = 0;
return 1;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |