Submission #710180

#TimeUsernameProblemLanguageResultExecution timeMemory
710180AstraytGame (APIO22_game)C++17
0 / 100
6 ms7288 KiB
#include <bits/stdc++.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){ 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 && u >= v) return 1; continue; } bfs.push(v); vis[v] = 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...