Submission #1225080

#TimeUsernameProblemLanguageResultExecution timeMemory
1225080KALARRYGame (APIO22_game)C++20
12 / 100
4077 ms7812 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-1 ; i++) adj[i].push_back(i+1); } bool visited[300005]; bool dfs(int v,int targ) { if(visited[v]) { if(v==targ) return true; return false; } visited[v] = true; bool ret = false; for(auto u : adj[v]) { if(ret) break; ret |= dfs(u,targ); } return ret; } int add_teleporter(int u, int v) { adj[u].push_back(v); bool ret = false; for(int i = 0 ; i < K ; i++) { memset(visited,false,sizeof(visited)); ret |= dfs(i,i); } if(ret) { for(int i = 0 ; i < N ; i++) adj[i].clear(); } return ret; }
#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...