# include "game.h"
# include <bits/stdc++.h>
using namespace std;
vector< vector< int > > Graph;
vector< bool > visited;
int n_;
bool cycle(int node, int last){
visited[node] =true;
for(int i = 0; i < n_; i++){
if(Graph[node][i] && !visited[i]){
if(cycle(i,node)) return true;
}else if(Graph[node][i] && visited[i] && i != last) return true;
}
return false;
}
void initialize(int n) {
n_ = n;
Graph.resize(n, vector<int>(n));
visited.resize(n);
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(i == j) continue;
Graph[i][j] = true;
Graph[j][i] = true;
}
}
}
int hasEdge(int u, int v) {
Graph[u][v] = false;
Graph[v][u] = false;
fill(visited.begin(), visited.end(), false);
if(cycle(u,-1)){
return 0;
}else{
Graph[u][v] = true;
Graph[v][u] = true;
return 1;
}
}
/*
signed main(){
int n;
cin >> n;
initialize(n);
for(int i = 0; i < n; i++){
for(int j = i+1; j < n; j++){
cout << i << ' ' << j << ' ' << hasEdge(i,j) << endl;
}
}
}
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |