BZOJ 1579: [Usaco2009 Feb]Revamping Trails 道路升级 分层图最短路_Dijkstra

BZOJ 1579: [Usaco2009 Feb]Revamping Trails 道路升级 分层图最短路_Dijkstra

Code：

#include<bits/stdc++.h>
#define setIO(s) freopen(s".in","r",stdin) 
#define maxn 100002 
#define N 21 
#define ll long long 
using namespace std;
int hd[10002],to[maxn],nex[maxn],val[maxn],vis[10002][N]; 
ll d[10002][N]; 
int edges,n,m,K,s,t;     
struct Node
{
    int u,k; 
    ll dis; 
    Node(int u=0,int k=0,ll dis=0):u(u),k(k),dis(dis){} 
    bool operator<(Node b) const 
    {
        return dis > b.dis; 
    }
}; 
priority_queue<Node>Q;  
void add(int u,int v,int c)
{
    nex[++edges]=hd[u],hd[u]=edges,to[edges]=v,val[edges]=c; 
}
void Dijkstra()
{
    memset(d, 0x3f, sizeof(d)); 
    d[1][0]=0; 
    Q.push(Node(1, 0, 0)); 
    while(!Q.empty())
    {
        Node e=Q.top(); Q.pop(); 
        int u=e.u,v,k=e.k; 
        if(vis[u][k]) continue; 
        vis[u][k]=1; 
        for(int i=hd[u];i;i=nex[i])
        {
            v=to[i]; 
            if(d[u][k] + val[i] < d[v][k]) 
            {
                d[v][k]=d[u][k]+val[i];                
                Q.push(Node(v, k, d[v][k])); 
            }
            if(d[u][k] < d[v][k + 1] && k+1 <= K) 
            {
                d[v][k + 1]=d[u][k]; 
                Q.push(Node(v, k + 1, d[v][k + 1])); 
            }
        }
    }
}
int main()
{
   //  setIO("input"); 
    scanf("%d%d%d",&n,&m,&K);
    for(int i=1,u,v,c;i<=m;++i)
    {
        scanf("%d%d%d",&u,&v,&c), add(u,v,c), add(v,u,c); 
    }         
    s=1,t=n; 
    Dijkstra(); 
    ll ans=1000000000000000; 
    for(int i=1;i<=K;++i) 
    {
        ans=min(ans, d[n][i]); 
    }
    printf("%lld\n",ans); 
    return 0; 
}

　　

posted @ 2019-06-05 10:25 EM-LGH 阅读( ...) 评论( ...) 编辑 收藏