Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 13243 | Accepted: 5959 |
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
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
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
Source
/*
题意要求是路是单向的,来回都走最短路,但求最少的时间所有的牛都能返回,不会求返回时的最短路,看了一下网上代码,矩阵转置,然后再求一次最短路 加油!!!
Time:2014-1-4 18:09
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAX=1010;
int g[MAX][MAX];
bool vis[MAX];
int n,m,x;
void Dijkstra(int s,int *disA){
for(int i=1;i<=n;i++)
disA[i]=g[s][i];
disA[s]=0;
memset(vis,0,sizeof(vis));
vis[s]=true;
for(int i=1;i<=n;i++){
int u=s,minV=INF;
for(int j=1;j<=n;j++){
if(!vis[j]&&minV>disA[j]){
u=j;
minV=disA[j];
}
}
vis[u]=true;
if(minV==INF)break;
for(int j=1;j<=n;j++){
if(!vis[j]&&disA[j]>disA[u]+g[u][j]){
disA[j]=disA[u]+g[u][j];
}
}
}
}
void Init(){
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
if(i==j)g[i][j]=0;
else g[i][j]=g[j][i]=INF;
}
}
}
void trans(){//转置矩阵
for(int i=1;i<=n;i++){
for(int j=1;j<i;j++){
swap(g[i][j],g[j][i]);
}
}
}
int disA[MAX];
int disB[MAX];
int main(){
int u,v,w;
while(scanf("%d%d%d",&n,&m,&x)!=EOF){
Init();
for(int i=1;i<=m;i++){
scanf("%d%d%d",&u,&v,&w);
if(g[u][v]>w)g[u][v]=w;
}
Dijkstra(x,disA);
trans();
Dijkstra(x,disB);
int ans=-1;
for(int i=1;i<=n;i++){
ans=max(ans,disA[i]+disB[i]);
}
printf("%d\n",ans);
}
return 0;
}