제출 #709794

#제출 시각아이디문제언어결과실행 시간메모리
709794ngano_upat_naGame (APIO22_game)C++17
0 / 100
5 ms7376 KiB
#include "game.h" #include "bits/stdc++.h" using namespace std; using ll = long long; int N = 300000; int K = -1; bool done = false; bool cyc = false; vector<vector<int>> adj(N); vector<bool> vis(N,false); void dfs(int u) { if (vis[u]) { if (u <= K-1) cyc = true; return; } vis[u] = true; for (auto &v:adj[u]) { dfs(v); } } void init(int n, int k) { N = n; K = k; for (int i=0; i<=k-2; i++) { adj[i].push_back(i+1); } } int add_teleporter(int u, int v) { adj[u].push_back(v); if (done) return 1; for (int i=0; i<N; i++) { vis[i] = false; } cyc = false; dfs(0); if (cyc) { done = true; return 1; } return 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...