Submission #1225065

#TimeUsernameProblemLanguageResultExecution timeMemory
1225065KALARRYGame (APIO22_game)C++20
0 / 100
3 ms7348 KiB
//chockolateman // #include "game.h" #include<bits/stdc++.h> using namespace std; int N,K; vector<int> adj[300005]; void init(int n, int k) { N = n; K = k; for(int i = 0 ; i <= k-2 ; i++) adj[i].push_back(i+1); } bool visited[300005]; bool dfs(int v) { if(visited[v]) if(v < K) return true; else return false; visited[v] = true; bool ret = false; for(auto u : adj[v]) { if(ret) break; ret |= dfs(u); } return ret; } int add_teleporter(int u, int v) { return true; adj[u].push_back(v); for(int i = 0 ; i < N ; i++) visited[i] = false; return dfs(0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...