851. spfa求最短路（用队列优化bellman——ford算法）

#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>

using namespace std;

const int N = 100010;

int h[N],e[N],ne[N],w[N], idx;

bool st[N];//判断这个点是否已经在队列中

int dist[N];

int n, m;

void add(int a, int b, int c )
{
    e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}

//用更新的点来更新此点所有出边
int spfa()
{
    memset(dist, 0x3f, sizeof dist);
    dist[1] = 0;
    
    queue<int> q;
    q.push(1);
    st[1] = true;
    
    while(q.size())
    {
        int t = q.front();
        q.pop();
        st[t] = false;
        
        for(int i = h[t]; i != -1; i = ne[i])
        {
            int j = e[i];
            if(dist[j] > dist[t] + w[i])
            {
                dist[j] = dist[t] + w[i];
                if(!st[j])
                {
                    st[j] = true;
                    q.push(j);
                }
            }
        }
    }
    
    if(dist[n] > 0x3f3f3f3f / 2) return -1;
    return dist[n];
}

int main()
{
    cin >> n >> m;
    memset(h, -1, sizeof h);
    
    while(m --)
    {
        int a, b, c;
        cin >>a >> b >> c;
        
        add(a, b, c);
    }
    
    if(spfa() == -1) cout << "impossible";
    else cout << spfa();
    
    return 0;
}//来自acwing