POJ_3255_Roadblocks【次短路径】

Roadblocks
Time Limit: 2000MS        Memory Limit: 65536K
Total Submissions: 14180        Accepted: 4983

Description

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 Input

4 4
1 2 100
2 4 200
2 3 250
3 4 100

Sample Output

450

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

某街区共有R条道路，N个路。道路可以双向通行。问1号路口到N号路口的次短路长度是多少？次短路指的比最短路路长度长的次短的路径。同一条边可能经过多次。
 
 思路：
   求次短路，可以通过求最短路得到次短路长度
   1到n的次短路长度必然产生于：从1走到x的最短路 + edge[x][y] +  y到n的最短路
  首先预处理好1到每一个节点的最短路，和n到每一个节点的最短路
  然后枚举每一条边作为中间边（x，y）或者（y，x），如果加起来长度等于最短路长度则跳过，否则更新
    

  从1走到x的最短路 + edge[x][y] +  y到n的最短路  给dist[n] 比较 找大于dist[n] 且是最小的那一个

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int R = 100000+5;
const int INF = 0x3f3f3f3f;
int n,m;
struct Node
{
	int v;
	int w;
	int next;
}edge[R*2];
int head[R/2];
int dist1[R/2];
int dist2[R/2];
bool vis[R/2];
int num;
void init()
{
	num = 0;
	memset(head,-1,sizeof(head));
	memset(dist1,0x3f,sizeof(dist1));
	memset(dist2,0x3f,sizeof(dist2));
}

void add_edge(int u,int v,int w)//邻接表 
{
	edge[num].v = v;
	edge[num].w = w;
	edge[num].next = head[u];
	head[u] = num++;
} 
void SPFA(int u,int *dist)
{
	int i,v,w;
	queue<int> Q;
	memset(vis,false,sizeof(vis));
	dist[u] = 0;
	vis[u] = true;
	Q.push(u);
	while(!Q.empty())
	{
		u = Q.front();
		Q.pop();
		vis[u] = false;
		for(i=head[u];i!=-1;i=edge[i].next)
		{
			v = edge[i].v;
			w = edge[i].w;
			if(dist[v] > dist[u] + w)
			{
				dist[v] = dist[u] + w;
				if(!vis[v])
				{
					vis[v] = true;
					Q.push(v); 
				}
			}
		}
	}
}
int main()
{
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int i,j,u,v,w;;
		init();
		for(i=1;i<=m;i++)//无向图，双向间图 
		{
			scanf("%d%d%d",&u,&v,&w);
			add_edge(u,v,w);
			add_edge(v,u,w);
		} 
		SPFA(1,dist1);//求 1 到所有点的最短路 
		SPFA(n,dist2);//求 n 到所有点的最短路 
		int ans = INF;
		for(i=1;i<=n;i++)
		{
			for(j=head[i];j!=-1;j=edge[j].next)
			{
				v = edge[j].v;
				w = edge[j].w;
				int tem = dist1[i] + dist2[v] + w; // 1 到 i这一点的最短路， n 到 j这一点的最短路 + edge[i][j] 
				if(tem > dist1[n] && tem < ans)    
				{
					ans = tem;
				}
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}