Submission #1201602

#TimeUsernameProblemLanguageResultExecution timeMemory
1201602adiyerGame (APIO22_game)C++20
30 / 100
4056 ms27080 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e5 + 11; int n, k, ver; int was[MAXN], r[MAXN], l[MAXN]; vector < int > g[MAXN], rg[MAXN]; void dfs(int v, int st){ was[v] = 1; if(v != st) r[v] = max(r[v], st); for(int u : g[v]){ if(!was[u]) dfs(u, st); else r[u] = max({r[v], r[u], st}); } } void dfs2(int v, int st){ was[v] = 1, l[v] = min(l[v], st); for(int u : rg[v]) if(!was[u]) dfs2(u, st); } void init(int _n, int _k) { n = _n, k = _k; for(int i = 0; i < k - 1; i++) g[i].push_back(i + 1), rg[i + 1].push_back(i); } int add_teleporter(int u, int v){ g[u].push_back(v); for(int i = 0; i < n; i++) r[i] = -1, l[i] = n; for(int i = 0; i < n; i++) was[i] = 0; for(int i = k - 1; i >= 1; i--) dfs(i, i); for(int i = 0; i < n; i++) was[i] = 0; dfs(0, 0); for(int i = 0; i < n; i++) was[i] = 0; for(int i = 0; i < k; i++) dfs2(i, i); for(int i = 0; i < n; i++) if(l[i] <= r[i]) 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...