Description
在有向图G 中,每条边的长度均为1 ,现给定起点和终点,请你在图中找一条从起点到终点的路径,该路径满足以下条件:
1 .路径上的所有点的出边所指向的点都直接或间接与终点连通。
2 .在满足条件1 的情况下使路径最短。
注意:图G 中可能存在重边和自环,题目保证终点没有出边。
请你输出符合条件的路径的长度。
Solution
考虑建反图后DFS找出哪些点不能到达终点,在找出哪些点与这些点相连,不能存在于路径中,删去,重新建图,跑最短路即可
Code
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#define rg register
#define stt static
#define For(i , j , k) for (rg int i = (j) , _##end_ = (k) ; i <= _##end_ ; ++ i)
#define Fordown(i , j , k) for (rg int i = (j) , _##end_ = (k) ; i >= _##end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define pb(a) push_back(a)
#define mp(a) make_pair(a)
#define INF (0x3f3f3f3f)
#define Mod (1000000007)
using namespace std;
typedef long long LL;
template <typename T> inline bool chkmax(T &a , T b) { return a < b ? (a = b , 1) : 0; }
template <typename T> inline bool chkmin(T &a , T b) { return b < a ? (a = b , 1) : 0; }
int _ , __;
char c_;
inline int read()
{
for (_ = 0 , __ = 1 , c_ = getchar() ; !isdigit(c_) ; c_ = getchar()) if (c_ == '-') __ = -1;
for ( ; isdigit(c_) ; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
return _ * __;
}
inline void file()
{
#ifdef hany01
freopen("road.in" , "r" , stdin); freopen("road.out" , "w" , stdout);
#endif
}
const int maxn = 10010 , maxm = 200010;
struct Edge
{
int u , v;
}E[maxm];
int v[maxm] , nex[maxm] , beg[maxn] , e , v1[maxm] , nex1[maxm] , beg1[maxn] , e1 , v2[maxm] , nex2[maxm] , beg2[maxn] , e2 , n , m , st , ed , dis[maxn] , out[maxn] , vis3[maxn] , vis4[maxn];
bool isin[maxn] , vis1[maxn] , vis2[maxn];
queue<int> q;
inline void add1(int uu , int vv)
{
v1[++ e1] = vv;
nex1[e1] = beg1[uu];
beg1[uu] = e1;
++ out[uu];
}
inline void add2(int uu , int vv)
{
v2[++ e2] = vv;
nex2[e2] = beg2[uu];
beg2[uu] = e2;
}
inline void add(int uu , int vv)
{
v[++ e] = vv;
nex[e] = beg[uu];
beg[uu] = e;
}
inline void Init()
{
n = read(); m = read();
For(i , 1 , m)
E[i].u = read(), E[i].v = read(),
add1(E[i].u, E[i].v), add2(E[i].v , E[i].u);
st = read();
ed = read();
}
void dfs1(int u)
{
vis1[u] = 1;
for (int i = beg1[u] ; i ; i = nex1[i])
if (!vis1[v1[i]])
dfs1(v1[i]);
}
void dfs2(int u)
{
vis2[u] = 1;
for (int i = beg2[u] ; i ; i = nex2[i])
if (!vis2[v2[i]])
dfs2(v2[i]);
}
void wjygaylao(int u)
{
for (int i = beg2[u] ; i ; i = nex2[i])
{
if (vis4[v2[i]])
vis4[v2[i]] = 0;
else
if (!vis3[v2[i]])
{
vis3[v2[i]] = 1;
wjygaylao(v2[i]);
}
vis3[v2[i]] = 1;
}
}
inline void rebuild()
{
For(i , 1 , m)
if (vis4[E[i].u] && vis4[E[i].v])
add(E[i].u , E[i].v);
}
void SPFA()
{
For(i , 1 , n) dis[i] = INF;
dis[st] = 0; q.push(st);
while (!q.empty()) {
register int u = q.front();
q.pop();
for (register int i = beg[u] ; i ; i = nex[i]) if (chkmin(dis[v[i]] , dis[u] + 1)) if (!isin[v[i]]) q.push(v[i]);
isin[u] = 0;
}
}
int main()
{
file();
Init();
dfs1(st);
dfs2(ed);
For(i , 1 , n)
vis4[i] = vis2[i];
For(i , 1 , n)
if (i != ed && !vis3[i] && !vis2[i])
{
vis3[i] = 1;
wjygaylao(i);
}
rebuild();
SPFA();
if (dis[ed] == INF)
puts("-1");
else
printf("%d\n" , dis[ed]);
return 0;
}