bzoj2662冻结（SPFA和dijkstra两个版本）

索性把这个的题解也写了，把飞行路线的代码稍改下就行了

SPFA

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int MAXN = 100000;
int head[MAXN],dis[MAXN][20],nxt[MAXN<<1],tot,n,m,k,st,se;
bool vis[MAXN][20];
struct Edge
{
    int from,to,cost;
}edge[MAXN<<1];
queue <int >q;
void build(int f,int t,int d)
{
    edge[++tot].from = f;
    edge[tot].to = t;
    edge[tot].cost = d;
    nxt[tot] = head[f];
    head[f] = tot;
}
void spfa(int s)
{
    memset(dis,0x3f,sizeof(dis));
    dis[s][0] = 0;
    q.push(s);
    q.push(0);
    vis[s][0] = 1;
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        int cs = q.front();
        q.pop();
        vis[x][cs] = 0;
        for(int i = head[x]; i; i = nxt[i])
        {
            int v = edge[i].to;
            if(dis[v][cs] > dis[x][cs] + edge[i].cost)
            {
                dis[v][cs] = dis[x][cs] + edge[i].cost;
                if(!vis[v][cs])
                {
                    vis[v][cs] = 1;
                    q.push(v);
                    q.push(cs);     
                }
            }
            if(cs < k)
            if(dis[v][cs+1] > dis[x][cs]+edge[i].cost/2)
            {
                dis[v][cs+1] = dis[x][cs]+edge[i].cost/2;
                if(!vis[v][cs+1])
                {vis[v][cs+1] = 1;
                    q.push(v);
                    q.push(cs+1);

                }
            }
        }
    }
}
int main()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i = 1; i <= m; i ++)
    {
        int aa,bb,cc;
        scanf("%d%d%d",&aa,&bb,&cc);
        build(aa,bb,cc);
        build(bb,aa,cc);
    }
    spfa(1);
    int ans = 214748364;
    for(int i = 0; i <= k; i++)
    {
        ans = min(ans,dis[n][i]);
    }
    printf("%d",ans);
}

dijkstra：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int MAXN = 3000000+5;
int head[MAXN],tot,n,m,k,dis[MAXN],nxt[MAXN<<1];
bool vis[MAXN];
struct Edge
{
    int from,to,cost;
}edge[MAXN << 1];
struct zt
{
    int u,v;
    bool operator < (const zt &b) const 
    {
        return v > b.v;
    };
};
priority_queue <zt> q;
void build(int f,int t,int d)
{
    edge[++tot] = (Edge){f,t,d};
    nxt[tot] = head[f];
    head[f] = tot;
}
void dijkstra(int s)
{
    memset(dis,0x7f,sizeof(dis));
    dis[s] = 0;
    q.push((zt){s,0});
    while(!q.empty())
    {
        int x = q.top().u;q.pop();
        if(vis[x])
        continue;
        vis[x] = 1;
        for(int i = head[x]; i ; i = nxt[i])
        {
            int v = edge[i].to;
            if(dis[v] > dis[x]+edge[i].cost)
            {
                dis[v] = dis[x]+edge[i].cost;
                q.push((zt){v,dis[v]});
            }
        }
    }
}
int main()
{
    int s, t;
    scanf("%d%d%d",&n,&m,&k);
    for(int i = 1; i <= m; i ++)
    {
        int aa,bb,cc;
        scanf("%d%d%d",&aa,&bb,&cc);
        for(int j = 0; j <= k; j ++)
        {
            build(j*n+aa,j*n+bb,cc);
            build(j*n+bb,j*n+aa,cc);
            if(j < k)
            {
                build(j*n+aa ,(j+1)*n+bb,cc/2);
                build(j*n+bb ,(j+1)*n+aa,cc/2);
            }
        }
    }
    dijkstra(1);
    int ans = 214748364;
    for(int i = 0; i <= k; i ++)
    ans = min(ans,dis[i*n+n]);
    printf("%d",ans);
    return 0;

}