Submission #1201577

#TimeUsernameProblemLanguageResultExecution timeMemory
1201577adiyerGame (APIO22_game)C++20
2 / 100
11 ms23892 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e5 + 11; int n, k, ok; int was[MAXN][2]; vector < int > g[MAXN][2]; void dfs(int v, bool t){ was[v][t] = 1; for(int u : g[v][t]) if(!was[u][t]) dfs(u, t); } void init(int _n, int _k) { n = _n, k = _k; for(int i = 0; i < k - 1; i++) g[i][0].push_back(i + 1), g[i + 1][1].push_back(i); dfs(0, 0); } int add_teleporter(int u, int v){ g[u][0].push_back(v); if(was[u][0]) dfs(u, 0); g[v][1].push_back(u); for(int i = 0; i < n; i++) was[i][1] = 0; dfs(u, 1); if(was[v][0] && was[v][1]) return 1; return 0; } namespace { int read_int() { int x; if (scanf("%d", &x) != 1) { fprintf(stderr, "Error while reading input\n"); exit(1); } return x; } } // namespace
#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...