Roadblocks

   Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She has decided to take the second-shortest rather than the shortest path. She knows there must be some second-shortest path.
   The countryside consists of R (1 ≤ R ≤ 100,000) bidirectional roads, each linking two of the N (1 ≤ N ≤ 5000) intersections, conveniently numbered 1..N. Bessie starts at intersection 1, and her friend (the destination) is at intersection N.
   The second-shortest path may share roads with any of the shortest paths, and it may backtrack i.e., use the same road or intersection more than once. The second-shortest path is the shortest path whose length is longer than the shortest path(s) (i.e., if two or more shortest paths exist, the second-shortest path is the one whose length is longer than those but no longer than any other path).
  Input
  
   Line 1: Two space-separated integers: 
   N and 
   R 

Lines 2…
R+1: Each line contains three space-separated integers:
A,
B, and
D that describe a road that connects intersections
A and
B and has length
D (1 ≤
D ≤ 5000)
Output

   Line 1: The length of the second shortest path between node 1 and node 
   N
  Sample Input4 4

1 2 100
2 4 200
2 3 250
3 4 100Sample Output450Hint

   Two routes: 1 -> 2 -> 4 (length 100+200=300) and 1 -> 2 -> 3 -> 4 (length 100+250+100=450)
  Sponsor

同时找最短路和次短路

#include<cstdio>
#include<vector>
#include<queue>
#define maxn 5005
#define maxm 200005
#define ri register int
#define inf 0x7fffffff
using namespace std;
priority_queue<pair<int,int> >q;//定义优先队列 
int to[maxm];//边的终点
int weight[maxm];//边的权值
int next[maxm];//下一条边的编号 
int head[maxn];//上一条边的编号
int dis1[maxn];//1到每个点的最短路 
int dis2[maxn];//1到每个点的次短路 
int n,m,cnt;
inline int read()//快读 
{
 ri f=1,x=0;
 char ch=getchar();
 while(ch<'0'||ch>'9')
 {
  if(ch=='-') f=-1;
  ch=getchar();
 }
 while(ch>='0'&&ch<='9')
 {
  x=x*10+ch-'0';
  ch=getchar();
 }
 return x*f;
}
void add_edge(int u,int v,int w)//建边 
{
 to[++cnt]=v;
 weight[cnt]=w;
 next[cnt]=head[u];
 head[u]=cnt;
}
void dijkstra()
{
 dis1[1]=0;
 q.push(make_pair(-dis1[1],1));
 while(!q.empty())
 {
  ri k=q.top().second,ki=-q.top().first;//因为进去的取了相反数，所以出来要添负号 
  q.pop();
  if(dis2[k]<ki) continue;//如果该点的次短路已经比要更新的小了，那么就不需要更新 
  for(ri i=head[k];i;i=next[i])
  {
   ri v=to[i],s=ki+weight[i];
   if(s<dis1[v])
   {
    dis1[v]=s;//更新最短路 
    q.push(make_pair(-dis1[v],v));
   }
   if(s>dis1[v]&&s<dis2[v])//比最短路长并且比次短路短 
   {
    dis2[v]=s;//更新次短路 
    q.push(make_pair(-dis2[v],v));
   }
  }
 }
}
int main()
{
 n=read(),m=read();
 for(ri i=1,x,y,z;i<=m;++i)
 {
  x=read(),y=read(),z=read();
  add_edge(x,y,z);
  add_edge(y,x,z);
 }
 for(ri i=1;i<=n;++i) dis1[i]=dis2[i]=inf;//都赋最大值 
 dijkstra();
 printf("%d",dis2[n]);
 return 0;
}