leetcode787. K 站中转内最便宜的航班 (从s到t最多k次中转求最短路 dijkstra dp与k条免费最短路有点像/spfa)

题目

dijkstra

class Solution {
#define pii pair<int,pair<int,int> >
#define mak(a,b) make_pair(a,b)
#define INF 0x3f3f3f3f
public:
    struct node{int to,len,nex;}edge[20000+5];
    int head[200],tot;
    void add(int from,int to,int len){
        edge[++tot]=(node){to,len,head[from]},head[from]=tot;
    }
    int n,K;
    priority_queue<pii,vector<pii>,greater<pii> >q;int d[200][200];
    int dijkstra(int s,int t){
        while(!q.empty()) q.pop();
        memset(d,INF,sizeof d);
        q.push(mak(0,mak(s,0))),d[s][0]=0;
        while(!q.empty()){
            int x=q.top().second.first,k=q.top().second.second;q.pop();
            for(int i=head[x];i;i=edge[i].nex){
                int y=edge[i].to,len=edge[i].len;
                if(k+1<=K&&d[x][k]+len<d[y][k+1]){
                    d[y][k+1]=d[x][k]+len;
                    q.push(mak(d[y][k+1],mak(y,k+1)));
                }
            }
        }
        int ans=INF;
        for(int i=1;i<=K;++i) ans=min(ans,d[t][i]);
        return ans==INF?-1:ans;
    }
    int findCheapestPrice(int n, vector<vector<int>>& vec, int s, int t, int K) {
        if(s==t) return 0;
        this->n=n,this->K=K+1;
        this->tot=0;memset(head,0,sizeof head);
        for(auto& x:vec) add(x[0],x[1],x[2]);
        return dijkstra(s,t);
    }
};