力扣寒假刷题日记（3）1.24 dijkstra求最短路径

一、今天每日一题

 

const int N=10010,M=4*N,INF=0x3f3f3f3f;
int h[N],e[M],ne[M],dist1[N],dist2[N];

class Solution {
public:
    int idx=0;
    void add(int a,int b){
        e[idx]=b;
        ne[idx]=h[a];
        h[a]=idx++;
    }

    int secondMinimum(int n, vector<vector<int>>& edges, int time, int change) {
        memset(h,-1,sizeof(h));
        for(auto&e:edges){
            add(e[0],e[1]);
            add(e[1],e[0]);
        }
        auto cmp=[](auto&a,auto&b){
            return a[1]>b[1];
        };
        priority_queue<array<int,2>,vector<array<int,2>>,decltype(cmp)>heap(cmp);
        memset(dist1,0x3f,sizeof(dist1));
        memset(dist2,0x3f,sizeof(dist2));
        heap.push({1,0});
        dist1[1]=0;
        while(heap.size())
        {
            auto k=heap.top();
            heap.pop();
            int var=k[0],dist=k[1];
            for(int i=h[var];~i;i=ne[i])
            {
                int j=e[i];
                if(dist1[j]>dist+1)
                {
                    dist2[j]=dist1[j];
                    dist1[j]=dist+1;
                    heap.push({j,dist1[j]});
                    heap.push({j,dist2[j]});
                }
                if(dist+1>dist1[j]&&dist+1<dist2[j])
                {
                    dist2[j] = dist+1;
                    heap.push({j,dist2[j]});
                }
            }
        }
        int ans=0;
        for(int i=0;i<dist2[n];++i){
            int a=ans/change,b=ans%change;
            int wait=a%2==0?0:change-b;
            ans+=time+wait;
        }
        return ans;
    }
};

题目有点复杂，看了题解才想明白，我是fw。主要是求最短路径再加上一个求动态边权，求动态边权想不明白。

记一下dijsktra算法的模板。

#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
const int N=100010,M=200020;
int h[N],e[M],ne[M],idx,w[M];
bool st[N];
int dist[N];
int n,m;
void add(int a,int b,int c)
{
    w[idx] = c,e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}
int dijkstra()
{
    memset(dist,0x3f,sizeof dist);
    auto cmp=[](auto&a,auto&b)
    {
        return a[1]<b[1];
    }
    priority_queue<array<int,2>,vector<array<int,2>>,decltype(cmp)> heap(cmp);
    dist[1]=0;
    heap.push({1,0});
    while(heap.size())
    {
        auto k = heap.top();
        heap.pop();
        int var=k[0],dist=k[1];
        if(st[var]) continue;
        st[var]=true;
        for(int i=h[var];~i;i=ne[i])
        {
            int j=e[i];
            if(dist[j]>dist+w[i])
            {
                dist[j]=dist+w[i];
                heap.push({j,dist[j});
            }
        }
    }
    return dist[n];
}
int main()
{
    memset(h,-1,sizeof h);
    cin>>n>>m;
    while(m--)
    {
        int a,b,c;
        add(a,b,c),add(b,a,c);
    }
    int t=dijstra();
}