Submission #572655

#TimeUsernameProblemLanguageResultExecution timeMemory
572655PlurmGame (APIO22_game)C++17
0 / 100
0 ms208 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; vector<int> g[1024]; int n, k; void init(int n, int k) { ::n = n; ::k = k; for (int i = 0; i < k - 1; i++) { g[i].push_back(i + 1); } } int color[1024]; bool dfs(int i) { if (color[i] == 2) return true; if (color[i] == 1) return i < k; color[i] = 1; for (int j : g[i]) { if (!dfs(j)) return false; } color[i] = 2; return true; } int add_teleporter(int u, int v) { memset(color, 0, sizeof(color)); g[u].push_back(v); bool ok = dfs(0); return ok ? 0 : 1; }
#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...