###### POJ3268
Silver Cow Party
 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14455 Accepted: 6511

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 ≤ XN). 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>
#define M 99999999
int map[1002][1002]={0},mapp[1002][1002]={0};
int d[1002],dt[1002];

void dijistra(int d[],int g[][1002],int n,int v)
{
int i,j;
int ss[1002];
int min;
int u;

for(i=1;i<=n;i++)
{
d[i]=M;
ss[i]=0;
}
d[v]=0;
for(i=1;i<=n;i++)
{
min=M;
for(j=1;j<=n;j++)
{
if(ss[j]==0&&d[j]<min)
{
min=d[j];
u=j;
}
}
ss[u]=1;
for(j=1;j<=n;j++)
{
if(d[u]+g[u][j]<d[j])
{
d[j]=d[u]+g[u][j];
}
}
}
}
int main()
{
int i,j,n,edge,party,cost,u,v;
int max;

scanf("%d %d %d",&n,&edge,&party);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
map[i][j]=M;
mapp[i][j]=M;
}
for(i=0;i<=edge;i++)
{
scanf("%d%d",&u,&v);
scanf("%d",&map[u][v]);
mapp[v][u]=map[u][v];
}
dijistra(d,map,n,party);
dijistra(dt,mapp,n,party);
max=0;
for(i=1;i<=n;i++)
{
if(max<d[i]+dt[i])
max=d[i]+dt[i];
}
printf("%d",max);
return 0;
}

#### poj3268 - Silver Cow Party

2012-08-16 10:20:10

#### poj3268 最短路

2016-09-21 20:56:31

#### POJ3268 解题报告

2017-07-23 01:01:13

#### POJ-3268-最短路(dijkstra算法)

2014-07-24 15:53:20

#### poj3268（dijkstra算法变形）

2017-03-19 23:41:49

#### POJ3268 牛的最长来回时间（单源最短路径）

2012-12-05 21:42:33

#### poj3268俩次SPFA。。。。。

2014-08-13 20:23:08

#### poj3268

2015-02-08 14:41:01

#### POJ 3268 Silver Cow Party(找最短路径的最大值+两次Dijkstra算法)

2017-08-22 20:00:16

#### poj3268（单源最短路）

2017-08-02 20:08:30

POJ3268