|洛谷|搜索|NOIP2014|P2296 寻找道路

https://www.luogu.org/problem/show?pid=2296

/*https://www.luogu.org/problem/show?pid=2296
(NOIP提高组2014), 搜索 
思路：建立反向边，从终点倒搜，标记与终点连通的点
之后再从终点倒搜一次最短路，一个点所有后继都被标记，即代表这个点可以走
*/
#include<cstdio>    
#include<algorithm>    
#include<cstring>    
#include<queue>
#include<vector>    
#define ms(i,j) memset(i,j, sizeof i);    
using namespace std;
int n,m;
vector<int> edge[10005];
vector<int> zedge[10005];
bool vi[10005];//是否访问过 
int ind[10005];//是否与终点连通 
int s,t;
int ans = -1;
void bfs1()//处理与终点连通
{
    queue<int> q;
    ms(ind,0);
    q.push(t); ind[t] = 1;
    while (!q.empty())
    {
        int u = q.front(); q.pop();
        for (int i=0;i<edge[u].size();i++)
        {
            int v = edge[u][i];
            if (!ind[v])
            {
                ind[v]=1;
                q.push(v);
            }
        }
    }
}
struct node {int u,s;};
void bfs2()
{
    queue<node> q;
    ms(vi,false);
    q.push((node){t,0}); vi[t] = true;
    while (!q.empty())
    {
        node u = q.front(); q.pop();
        if (u.u==s) 
        {
            ans = u.s; return ;
        }
        for (int i=0;i<edge[u.u].size();i++)
        {
            int v = edge[u.u][i];
            bool flag = false;
            for (int k=0;k<zedge[v].size();k++)
            if (ind[zedge[v][k]]==0) {flag = true; break;}
            if (flag) continue;
            if (!vi[v])
            {
                vi[v] = true;
                q.push((node){v,u.s+1});
            }
        }
    }
}
int main()    
{    
    scanf("%d%d", &n,&m);
    for (int i=1;i<=m;i++)
    {
        int x,y;
        scanf("%d%d", &x, &y);
        if (x==y) continue;
        edge[y].push_back(x);//反向边 
        zedge[x].push_back(y);//正向边 
    }    
    scanf("%d%d", &s, &t);
    bfs1();
    bfs2();
    printf("%d\n", ans);
    return 0;    
}