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;
#define pb push_back
const int mxN = (int)2e5+10;
int n, k, sm[mxN], bg[mxN];
vector<int> adj[mxN], radj[mxN];
void init(int N, int K) {
n = N; k = K;
for(int i = 0; i < k; i++)
sm[i]=i, bg[i] = k-1;
for(int i = k; i < n; i++)
sm[i] = bg[i] = n+1;
}
void dfs(int s, int c){
if(sm[s]<=c) return;
sm[s] = min(sm[s], c); bg[s]=k-1;
for(auto u : radj[s]) dfs(u,c);
}
int add_teleporter(int u, int v) {
if(u>=v and u<k) return 1;
if(max(u,v)<k) return 0;
radj[v].pb(u); dfs(u, sm[v]);
return (sm[v]<=bg[u] and bg[u]<=k);
}
# | 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... |