【题意分析】
这是道挺好的思维题,但是被我秒了
首先直觉告诉我们连反边,从终点开始往前进行bfs扩展标记,把那些可以到达终点的边全都找出来。
但题目说能到达终点的点,他们连向的点全部都能到达终点,那么我们就找那些没有标记的点,他们连向的点全部是不符合要求的
这样筛选过之后剩下的全都是符合题意的点,跑一遍最短路就好了
Code:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#define INF 2147400000
#define MAXN 300000
using namespace std;
struct fls {
int to, next;
}edge[MAXN];
bool vis[MAXN], Vis[MAXN];
int head[MAXN], q[MAXN], dist[MAXN], n, m, S, T, cnt;
inline int read () {
register int s = 0, w = 1;
register char ch = getchar ();
while (! isdigit (ch)) {if (ch == '-') w = -1; ch = getchar ();}
while (isdigit (ch)) {s = (s << 3) + (s << 1) + (ch ^ 48); ch = getchar ();}
return s * w;
}
inline void connect (int u, int v) {
if (u == v) return;
edge[++cnt].to = v, edge[cnt].next = head[u], head[u] = cnt;
}
void BFS () {
int t = 1, w = 1; q[t] = T, vis[T] = 1;
while (t <= w) {
for (register int i = head[q[t]]; i; i = edge[i].next) {
int v = edge[i].to; if (vis[v]) continue;
q[++w] = v, vis[v] = 1;
}
t++;
}
}
inline void del (int now) {
for (register int i = head[now]; i; i = edge[i].next) {
int v = edge[i].to; if (vis[v]) Vis[v] = 0;
}
}
void SPFA () {
memset (vis, 0, sizeof vis); memset (q, 0, sizeof q);
for (register int i = 1; i <= n; i++) dist[i] = INF;
int t = 1, w = 1; q[t] = T, vis[T] = 1, dist[T] = 0;
while (t <= w) {
int now = q[t]; vis[now] = 1;
for (register int i = head[now]; i; i = edge[i].next) {
int v = edge[i].to; if (! Vis[v]) continue;
if (dist[v] > dist[now] + 1) {
dist[v] = dist[now] + 1;
if (! vis[v]) vis[v] = 1, q[++w] = v;
}
}
t++;
}
}
int main () {
n = read (), m = read ();
for (register int i = 1; i <= m; i++) connect (read (), read ());
S = read (), T = read (), BFS (), memcpy (Vis, vis, sizeof vis);
for (register int i = 1; i <= n; i++)
if (! vis[i]) del (i);
SPFA (); return printf ("%d\n", dist[S] == INF ? -1 : dist[S]), 0;
}
/*
3 2
1 2
2 1
1 3
*/