Silver Cow Party（Dijkstra）

Silver Cow Party

Description

One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1…N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; road i requires Ti (1 ≤ Ti ≤ 100) units of time to traverse.

Each cow must walk to the party and, when the party is over, return to her farm. Each cow is lazy and thus picks an optimal route with the shortest time. A cow’s return route might be different from her original route to the party since roads are one-way.

Of all the cows, what is the longest amount of time a cow must spend walking to the party and back?

Input

Line 1: Three space-separated integers, respectively: N, M, and X
Lines 2…M+1: Line i+1 describes road i with three space-separated integers: Ai, Bi, and Ti. The described road runs from farm Ai to farm Bi, requiring Ti time units to traverse.
Output

Line 1: One integer: the maximum of time any one cow must walk.

Sample Input

4 8 2
1 2 4
1 3 2
1 4 7
2 1 1
2 3 5
3 1 2
3 4 4
4 2 3
Sample Output

10
Hint

Cow 4 proceeds directly to the party (3 units) and returns via farms 1 and 3 (7 units), for a total of 10 time units.

题意
n 头牛m 条路 , 到 w 牛处参加聚会去和回来不是同一条路，最短路径中最长是多少？

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int e[1111][1111],dis[1111],book[1111],inf=999999;
int t1,t2,t3,u,v,w,minx,x,n,m,i,j,mm;
void ac() {
	memset(dis,0,sizeof(dis));
	for(i=1; i<=n; i++)
		dis[i]=e[x][i];
	memset(book,0,sizeof(book));
	book[x]=1;
	for(i=1; i<=n-1; i++) {
		mm=inf;
		for(j=1; j<=n; j++) {
			if(book[j]==0&&dis[j]<mm) {
				mm=dis[j];
				u=j;
			}
		}
		book[u]=1;
		for(v=1; v<=n; v++) {
			if(e[u][v]<inf) {
				dis[v]=min(dis[v],dis[u]+e[u][v]);
			}
		}
	}
	return ;
}
int main() {
	scanf("%d%d%d",&n,&m,&w);
	for(i=1; i<=n; i++)
		for(j=1; j<=n; j++)
			if(i==j) e[i][j]=0;
			else e[i][j]=inf;
	while(m--) {
		scanf("%d%d%d",&t1,&t2,&t3);
		if(e[t1][t2]==inf||e[t1][t2]==0)
			e[t1][t2]=t3;
		else e[t1][t2]=min(e[t1][t2],t3);
	}
	x=w;
	minx=0;
	ac();
	int f[1111]= {0};
	for(i=1; i<=n; i++)
		f[i]=dis[i];//copy 从x 到各个点的最短长度
	for(i=1; i<=n; i++)//图像转化
		for(j=i+1; j<=n; j++) {//j 从i+1开始
			int t=e[j][i];
			e[j][i]=e[i][j];
			e[i][j]=t;
		}
	ac();
	for(i=1; i<=n; i++)
		if(i!=x)
			minx=max(minx,f[i]+dis[i]);//最短路中找最大
	printf("%d\n",minx);
}