# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
709790 | ngano_upat_na | Game (APIO22_game) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
int N = 300000;
int K = -1;
bool done = false;
bool cyc = false;
vector<int> adj[N];
vector<bool> vis(N,false);
void dfs(int u) {
if (vis[u]) {
cyc = true;
return;
}
vis[u] = true;
for (auto &v:adj[u]) {
dfs(v);
}
}
void init(int n, int k) {
N = n;
K = k;
for (int i=0; i<=k-2; i++) {
adj[i].push_back(i+1);
}
}
int add_teleporter(int u, int v) {
adj[u].push_back(v);
if (done) return 1;
for (int i=0; i<N; i++) {
vis[i] = false;
}
cyc = false;
dfs(0);
if (cyc) return 1;
return 0;
}