847. 图中点的层次

AcWing题目链接

BFS模板题

用数组模拟队列

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 1e5+5;
const int M = 2e5+5;
int h[N], e[M], ne[M];
int d[N], q[N];
int idx = 0, n, m;
void add(int a, int b){
    e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}
int bfs(){
    int hh = 0, tt = 0;
    memset(d, -1, sizeof d);
    q[0] = 1;
    d[1] = 0;
    while(hh <= tt){
        int t = q[hh++];
        for(int i = h[t]; i != -1; i = ne[i]){
            int j = e[i];
            if(d[j] == -1){
                q[++tt] = j;
                d[j] = d[t]+1;
            }
        }
    }
    return d[n];
}
int main(){
    int a, b;
    cin>>n>>m;
    memset(h, -1, sizeof h);
    for(int i = 0; i < m; i++){
        cin>>a>>b;
        add(a, b);
    }
    cout<<bfs()<<endl;
    return 0;
}