# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706538 | grossly_overconfident | 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 "game.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adjchart;
int K, N;
bool cycledetector4000(int i, int oi, bool f, vector<bool>& v, vector<bool>& dpcache){
if (!f && i == oi){
return true;
}
if (v[i]){
return dpcache[i];
}
bool pl = false;
for (int j : adjchart[i]){
pl |= cycledetector4000(j, oi, false, v, dpcache);
}
v[i] = true;
return dpcache[i] = pl;
}
void init(int n, int k) {
adjchart.resize(n);
K = k;
N = n;
for (int i = 0; i < k - 1; ++i){
adjchart[i].push_back(i + 1);
}
}
int add_teleporter(int u, int v) {
adjchart[u].push_back(v);
vector<bool> v(N);
vector<bool> dpcache(N);
bool pl = false;
for (int i = 0; i < K; ++i){
pl |= cycledetector4000(i, i, true, v, dpcache);
}
if (pl){
return 1;
}
return 0;
}