제출 #710027

#제출 시각아이디문제언어결과실행 시간메모리
710027Astrayt게임 (APIO22_game)C++17
0 / 100
4 ms7248 KiB
#include <bits/stdc++.h> #include "game.h" using namespace std; typedef long long ll; #define pb push_back #define maxn 300005 int N, K; vector<int> adj[maxn]; void init(int n, int k){ N = n, K = k; for(int i = 0; i < k - 1; ++i) adj[i].pb(i + 1); } int add_teleporter(int u, int v){ if(u == v){ if(u <= K) return 1; return 0; } adj[u].pb(v); vector<bool> vis(N, 0); queue<int> bfs; bfs.push(0), vis[0] = 1; while(bfs.size()){ int u = bfs.front(); bfs.pop(); for(auto v:adj[u]){ if(vis[v]){ if(v <= K) return 1; continue; } bfs.push(v); vis[v] = 1; } } return 0; } /* int main(){ int n, m, k; cin >> n >> m >> k; init(n, k); bool ok = 1; for(int i = 0; i < m; ++i){ int u, v; cin >> u >> v; int r = add_teleporter(u, v); if(r) { cout << i << '\n'; ok = 0; break; } } if(ok) cout << m << '\n'; } */
#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...