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;
const int maxn = 1e3 + 100;
int n, k, t;
vector<int> g[maxn];
int used[maxn];
bool ok(int v){
used[v] = t;
for(int to: g[v]){
if(used[to] == t) return 1;
if(used[to] != t + 1 && ok(to)) return 1;
}
used[v] = t + 1;
return 0;
}
void init(int N, int K){
n = N; k = K;
for(int i = 1; i < k; i++){
g[i].push_back(i+1);
}
}
int add_teleporter(int u, int v){
u++; v++;
g[u].push_back(v);
for(int i = 1; i <= k; i++){
t += 2;
if(ok(i)) return 1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |