题目链接
解题思路
这题是道比较简单的图论题。我们只能经过一些点,这些点指向的点能直接或间接到达终点
t
t
t,其实就相当于我们只能走一些点,这些点指向的点都能从
t
t
t点遍历得来。
OK,第一步思路有了,反向建边 (注意判自环!),从
t
t
t点跑一遍DFS/BFS,标记所有能从
t
t
t点走过来的点。
那么,如何求出我们只能经过的点呢?我们只要枚举在上述的DFS/BFS过程中,从
t
t
t点无法到达的点。这些点不仅它们本身不能经过,而且它们指向的(边是反的哦)点也不能被经过。只要再(想一想,为什么?)开个
f
l
a
g
flag
flag数组,记下可以被经过的点。
好的,我们已经做了这么多了,只要再来遍BFS(注意,一定是BFS!!!)求最小距离即可。(Dijkstra也行,但是杀鸡焉用牛刀)
详细代码
#define USEFASTERREAD 1
#define rg register
#define inl inline
#define DEBUG printf("[Passing [%s] in line %d.]\n", __func__, __LINE__)
#define putline putchar('\n')
#define putsp putchar(' ')
#define Rep(a, s, t) for(rg int a = s; a <= t; a++)
#define Repdown(a, t, s) for(rg int a = t; a >= s; a--)
typedef long long ll;
#include<cstdio>
#define rs freopen("test.in", "r", stdin), freopen("test.out", "w", stdout)
#if USEFASTERREAD
char In[1 << 20], *ss = In, *tt = In;
#define getchar() (ss == tt && (tt = (ss = In) + fread(In, 1, 1 << 20, stdin), ss == tt) ? EOF : *ss++)
#endif
struct IO {
void RS() {rs;}
template<typename T> inline IO r(T& x)const {
x = 0; T f = 1; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') f = -1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + int(ch - '0');
x *= f; return *this;
}
template<typename T> inline IO w(T x)const {
if(x < 0) {putchar('-'); x = -x;}
if(x >= 10) w(x / 10);
putchar(x % 10 + '0'); return *this;
}
template<typename T> inline IO wl(const T& x)const {w(x), putline; return *this;}
template<typename T> inline IO ws(const T& x)const {w(x), putsp; return *this;}
inline IO l() {putline; return *this;}
inline IO s() {putline; return *this;}
}io;
template<typename T> inline T Max(const T& x, const T& y) {return y < x ? x : y;}
template<typename T> inline T Min(const T& x, const T& y) {return y < x ? y : x;}
template<typename T> inline void Swap(T& x, T& y) {T tmp = x; x = y; y = tmp;}
#include<queue>
#include<cstring>
using namespace std;
const int MAXN = 10005;
const int MAXM = 200005;
const int INF = 0x3f3f3f3f;
int n, m;
struct Edge {
int v, nxt;
}e[MAXM];
int head[MAXN], cnt;
void addedge(int u, int v) {
e[++cnt].v = v;
e[cnt].nxt = head[u];
head[u] = cnt;
}
int s, t;
bool vist[MAXN];
bool flag[MAXN];
int dist[MAXN];
int main() {
//io.RS();
io.r(n).r(m);
for(rg int i = 1; i <= m; i++) {
int x, y;
io.r(x).r(y);
if(x == y) continue;
addedge(y, x);
}
io.r(s).r(t);
queue<int> q;
q.push(t);
vist[t] = 1;
while(!q.empty()) {
int u = q.front(); q.pop();
for(rg int i = head[u]; i; i = e[i].nxt)
if(!vist[e[i].v]) vist[e[i].v] = 1, q.push(e[i].v);
}
memset(flag, 1, sizeof flag);
for(rg int i = 1; i <= n; i++)
if(!vist[i]) {
flag[i] = 0;
for(rg int j = head[i]; j; j = e[j].nxt)
flag[e[j].v] = 0;
}
memset(dist, 0x3f, sizeof dist);
dist[t] = 0;
q.push(t);
while(!q.empty()) {
int u = q.front(); q.pop();
for(rg int i = head[u]; i; i = e[i].nxt) {
int v = e[i].v;
if(flag[v]) {
q.push(v);
flag[v] = 0;
dist[v] = dist[u] + 1;
}
}
}
io.wl(dist[s] == INF ? -1 : dist[s]);
return 0;
}