Submission #1192421

#TimeUsernameProblemLanguageResultExecution timeMemory
1192421GoBananas69Game (IOI14_game)C++20
0 / 100
0 ms324 KiB
#include <algorithm> #include <array> #include <bitset> #include <cmath> #include <iostream> #include <vector> using namespace std; typedef long long ll; vector<vector<int>> adj; vector<bool> vis; void initialize(int n) { adj.resize(n); vis.resize(n, false); } void dfs(int u) { vis[u] = true; for (int &v: adj[u]) { if (vis[v]) continue; dfs(v); } } bool hasEdge(int u, int v) { adj[u].push_back(v); dfs(0); if (vis[v]) { adj[u].pop_back(); return false; } return true; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...