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;
typedef long long ll;
#define pb push_back
#define maxn 300005
int N, K;
vector<int> adj[maxn];
void init(int n, int k){
N = n, K = k;
for(int i = 0; i < k - 1; ++i) adj[i].pb(i + 1);
}
int add_teleporter(int u, int v){
adj[u].pb(v);
vector<bool> vis(N, 0);
queue<int> bfs;
bfs.push(0), vis[0] = 1;
while(bfs.size()){
int u = bfs.front(); bfs.pop();
for(auto v:adj[u]){
if(vis[v]){
if(v < K && u >= v) return 1;
continue;
}
bfs.push(v);
vis[v] = 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... |