POJ 3268 Silver Cow Party (最短路)

Silver Cow Party

Time Limit: 2000MS Memory Limit: 65536K

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 T_i (1 ≤ T_i ≤ 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: A_i, B_i, and T_i. The described road runs from farm A_i to farm B_i, requiring T_i time units to traverse.

Output

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

Sample Input

Sample Output

10

模板题，分别对原图和逆图求一次最短路就行了

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;

const int MAXN = 1100;
const int INF = 0x3f3f3f3f;
int cost[MAXN][MAXN];
int dis1[MAXN];
int dis2[MAXN];
bool vis[MAXN];

void Dijkstra(int n,int dis[],int st)
{
    memset(vis,false,sizeof(vis));
    int minc,k;
    vis[st]=true;
    for(int i=1;i<=n;i++) dis[i]=cost[st][i];
    dis[st]=0;
    for(int i=1;i<=n;i++){
        minc=INF;
        for(int j=1;j<=n;j++){
            if(!vis[j]&&dis[j]<minc){
                minc=dis[j];
                k=j;
            }
        }
        if(minc>=INF) break;
        vis[k]=true;
        for(int j=1;j<=n;j++)
            if(!vis[j]&&dis[k]+cost[k][j]<dis[j])
               dis[j]=dis[k]+cost[k][j];
    }
}

int main()
{
    int N,M,X;
    int u,v,w;
    while(scanf("%d%d%d",&N,&M,&X)!=EOF){
        memset(dis1,0,sizeof(dis1));
        memset(dis2,0,sizeof(dis2));
        for(int i=1;i<=N;i++){
            for(int j=1;j<=N;j++){
                if(i==j) cost[i][j]=0;
                else cost[i][j]=INF;
            }
        }
        for(int i=1;i<=M;i++){
            scanf("%d%d%d",&u,&v,&w);
            cost[u][v]=w;
        }
        Dijkstra(N,dis1,X);
        for(int i=1;i<=N;i++)
            for(int j=1;j<i;j++)
                swap(cost[i][j],cost[j][i]);
        Dijkstra(N,dis2,X);
        int ans=0;
        for(int i=1;i<=N;i++) ans=max(ans,dis1[i]+dis2[i]);
        printf("%d
",ans);
    }
    return 0;
}