Submission #518706

#TimeUsernameProblemLanguageResultExecution timeMemory
518706EveruleGame (IOI14_game)C++14
42 / 100
1012 ms1444 KiB
#include <bits/stdc++.h> #include "game.h" using namespace std; using ll = long long; vector<vector<int>> g; vector<bool> vis; int n; void initialize(int _n) { n = _n; g.resize(n, vector<int>(n, 1)); } void dfs(int u){ vis[u] = 1; for(int v=0;v<n;v++){ if(g[u][v] && !vis[v]) dfs(v); } } int hasEdge(int u, int v) { g[u][v] = g[v][u] = 0; vis.assign(n, 0); dfs(0); return g[u][v] = g[v][u] = (accumulate(vis.begin(), vis.end(), 0) != n); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...