Roadblocks (POJ - 3255)

题目链接： https://vjudge.net/contest/280753#problem/F
题意: 给一个无向图，求1-n的次短路距离
思路: 用dijkstra稍微修改一下就行，把最短路与次短路同时储存下来

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#define INF 0x3f3f3f3f
using namespace std;
int n,r,top;
int head[5005],dis1[5005],dis2[5005];
struct node1
{
    int to,next,len;
}edge[200005];
struct node
{
    int v,d;
    bool operator < (const node &a)const
    {
        return d>a.d;
    }
}tmp1,tmp2;
void add(int u,int v,int c)
{
    edge[top].to=v;
    edge[top].next=head[u];
    edge[top].len=c;
    head[u]=top++;
}
void dijksta()
{
    priority_queue<node>que;
    memset(dis1,0x3f,sizeof dis1);
    memset(dis2,0x3f,sizeof dis2);
    dis1[1]=0;
    que.push(node{1,0});
    while(que.size())
    {
        tmp1=que.top();
        que.pop();
        int d=tmp1.d,v=tmp1.v;
        if(d>dis2[v])
            continue;
        for(int i=head[v];i!=-1;i=edge[i].next)
        {
            v=edge[i].to;
            if(dis1[v]>d+edge[i].len)
            {
                dis2[v]=dis1[v];
                dis1[v]=d+edge[i].len;
                que.push(node{v,dis1[v]});
            }
            else if(dis1[v]<d+edge[i].len&&dis2[v]>d+edge[i].len)
            {
                dis2[v]=d+edge[i].len;
                que.push(node{v,dis2[v]});
            }
        }
    }

}
int main()
{
    int a,b,c;
    scanf("%d%d",&n,&r);
    memset(head,-1,sizeof head);
    for(int i=1;i<=r;i++)
    {
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);
        add(b,a,c);
    }
    dijksta();
    printf("%d\n",dis2[n]);
    return 0;
}