→题目链接←
裸最短路
代码:
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<queue>
#define ll long long
#define inf 233333
using namespace std;
int n,m;
vector<int>v[50050];
int dis[50050];
queue<int>q;
int main(){
scanf("%d%d",&m,&n);
for(int i=0; i<m; i++){
int x,y;
scanf("%d%d",&x,&y);
v[x].push_back(y);
}
for(int i=1; i<=n; i++)dis[i]=inf;
dis[1]=0;
q.push(1);
while(!q.empty()){
int t=q.front();
q.pop();
for(int i=0; i<v[t].size(); i++){
int to=v[t][i];
if(dis[to]>dis[t]+1){
dis[to]=dis[t]+1;
q.push(to);
}
}
}
if(dis[n]==inf)printf("-1\n");
else printf("%d\n",dis[n]+1);
return 0;
}