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<int> g[300005];
int n, k;
void init(int _n, int _k) {
n = _n;
k = _k;
for(int i = 1; i < k; ++i) {
g[i-1].push_back(i);
}
}
bool used[300005], ok;
int root;
void dfs(int v) {
used[v] = 1;
for(auto to : g[v]) {
if(!used[to]) {
dfs(to);
}
}
}
int add_teleporter(int u, int v) {
if(v<=u && v<k) {
return 1;
}
g[u].push_back(v);
for(int i = 0; i < k; ++i) {
fill(used, used+n, 0);
dfs(i);
for(int j = 0; j < n; ++j) {
if(used[j]) {
for(auto to : g[j]) {
if(to == 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... |