【 BZOJ 2763 】【 飞行路线 】【 分层图 最短路 模型 】

推荐博客 （详细） ： 本题 + 分层图最短路 讲解

双端队列：如果对一个点更新，当前点比我队首的元素值还小，那么我就把这个点加在队首，否则加在队尾。

因此，利用双端队列 优化 Spfa

 

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <deque>
#define LL long long
#define M 100004
#define N 10004
#define U 12
using namespace std;

inline int wread(){
    char c=getchar ();int flag=1,wans=0;
    while (c<'0'||c>'9'){if (c=='-') flag=-1;c=getchar ();}
    while (c>='0'&&c<='9'){wans=wans*10+c-'0';c=getchar ();}
    return wans*=flag;
}

inline void OUT (int x){
    if (x>9)	OUT(x/10);
    putchar (x%10+'0');
}

inline void init (){
    freopen (" ","r",stdin);
    freopen (" ","w",stdout);
}

int n,m,k,st,ed;
int K,hed[N];
struct node {int v,w,nxt;}e[M];

void ad (int u,int v,int w){e[++K]=(node){v,w,hed[u]};hed[u]=K;}
int dis[N][U];
bool vis[N][U];

struct node2{int nx,cnt;};
deque <node2> Q;

int Spfa (){
    memset (dis,0x7f7f7f7f,sizeof dis);
    Q.push_front((node2){st,0});
    dis[st][0]=0;
    while (!Q.empty()){
        node2 F=Q.front();
        Q.pop_front();
        int x(F.nx),ci(F.cnt);
        vis[x][ci]=false;
        for (int i(hed[x]);i!=-1;i=e[i].nxt){
            int v(e[i].v);
            if (dis[v][ci] > (LL)dis[x][ci] + e[i].w){
                dis[v][ci] = dis[x][ci] + e[i].w;
                if (!vis[v][ci]){
                    if (Q.empty()){
                        Q.push_front((node2){v,ci}); 
                    }
                    else {
                        node2 nx(Q.front());
                        if (dis[nx.nx][nx.cnt]>=dis[v][ci])
                            Q.push_front((node2){v,ci});
                        else
                            Q.push_back((node2){v,ci});
                    }
                    vis[v][ci]=true;				
                }
            }
            if (ci<k){
                if (dis[v][ci+1] > dis[x][ci]) {
                    dis[v][ci+1] = dis[x][ci];
                    if (!vis[v][ci+1]){
                        if (Q.empty()){
                            Q.push_front((node2){v,ci+1});
                        }
                        else {
                            node2 nx(Q.front());
                            if (dis[nx.nx][nx.cnt] >= dis[v][ci+1])
                                Q.push_front((node2){v,ci+1});
                            else 
                                Q.push_back((node2){v,ci+1});
                        }
                        vis[v][ci+1]=true;					
                    }
                }
            }
        }
    }
    int res(0x7f7f7f7f);
    for (int i(0);i<=k;++i)
        res=min (res,dis[ed][i]);
    return res;
}

int main (){
//	init ();
    memset (hed,-1,sizeof hed);
    n=wread();m=wread();k=wread();
    st=wread();ed=wread();
    st++;ed++;
    for (int i(1);i<=m;++i){
        int u(wread()),v(wread()),w(wread());
        u++;v++;
        ad (u,v,w);ad (v,u,w);
    }
    OUT(Spfa());
    
    return 0;
}