Submission #957576

#TimeUsernameProblemLanguageResultExecution timeMemory
957576vjudge1Game (APIO22_game)C++17
12 / 100
4013 ms8024 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; vector<int> g[300005]; int n, k; void init(int _n, int _k) { n = _n; k = _k; for(int i = 1; i < k; ++i) { g[i-1].push_back(i); } } bool used[300005], ok; int root; void dfs(int v) { used[v] = 1; for(auto to : g[v]) { if(!used[to]) { dfs(to); } } } int add_teleporter(int u, int v) { g[u].push_back(v); for(int i = 0; i < k; ++i) { fill(used, used+n, 0); dfs(i); for(int j = 0; j < n; ++j) { if(used[j]) { for(auto to : g[j]) { if(to == i) { 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...