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.
大致意思说:母牛的返回路线可能与她最初的派对路线不同,因为道路是单向的。在所有的奶牛中,一头母牛要花多少时间才能走到派对上,然后再回来,求最长需要花费的时间。
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int inf=99999999,book[1100],e[1001][1001],dis[10000],dis1[10000],n,m;
void dij(int v)//单源最短路径
{
int i,j,k,min,u;
memset(book,0,sizeof(book));
for(i=1;i<=n;i++)
dis[i]=e[v][i];
book[v]=1;
for(i=1;i<=n;i++)
{
min=inf;
for(j=1;j<=n;j++)
{
if(book[j]==0&&dis[j]<min)
{
min=dis[j];
u=j;
}
}
book[u]=1;
for(j=1;j<=n;j++)
{
if(e[u][j]<inf)
{
if(dis[j]>dis[u]+e[u][j])
{
dis[j]=dis[u]+e[u][j];
}
}
}
}
}
int main()
{
int t,i,j,a,b,c,d;
scanf("%d %d %d",&n,&m,&t);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==j)
e[i][j]=0;
else
e[i][j]=inf;
}
for(i=1;i<=m;i++)
{
scanf("%d %d %d",&a,&b,&c);
if(e[a][b]>c)
e[a][b]=c;
}
//正方向dilkstra
dij(t);
for(i=1;i<=n;i++)
dis1[i]=dis[i];
//转置
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i>=j)
{
d=e[i][j];
e[i][j]=e[j][i];
e[j][i]=d;
}
}
}
//反方向dijkstra
dij(t);
int max1=-1;
for(i=1;i<=n;i++)
{
max1=max(max1,dis1[i]+dis[i]);//max函数需要添加头文件
}
printf("%d\n",max1);
return 0;
}