POJ 3268 Silver Cow Party （dijkstra+矩阵转置）

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.

 

注意：输入！=EOF ，不然会输出超时。由于是单向边，转置前是起点到各点的最短距离，转置后再来一次dijkstra相当于各点到起点 的最短距离。然后取两次和的最大值即可。用转置是为了将复杂度

#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include<cstdio>
#include <cstring>
#include <queue>
#include <map>
#include <string.h>
#include<bitset>
typedef long long ll;

using namespace std;
const int   inf=0x3f3f3f3f;
//int inf  = 2e7+100;


int n,m,s;
int   G[2222][2222];
int vis[1111],d[1111],p[1111];

void dij()
{
    for(int i=1;i<=n;i++)
    {
        vis[i]=0;
        d[i]=G[s][i];
    }
    d[s]=0;
    for(int i=1;i<=n;i++)
    {
        int u=-1,mi=inf;
        for(int j=1;j<=n;j++)
        {
            if(!vis[j]&&d[j]<mi)
            {
                mi=d[j];
                u=j;
            }
        }
        if(u==-1)
            break;
        vis[u]=1;
        for(int j=1;j<=n;j++)
        {
            if(!vis[j]&&d[j]>d[u]+G[u][j])
                d[j]=d[u]+G[u][j];
        }
    }
}

int main()
{
    while(scanf("%d%d%d",&n,&m,&s)!=EOF)
    {
        for(int i=1;i<=n;i++)
          for(int j=1;j<=n;j++)
             G[i][j]=i==j?0:inf;
        for(int i=1;i<=m;i++)
        {
            int a ,b,c;
            scanf("%d%d%d",&a,&b,&c);
           if(c<G[a][b])
                G[a][b]=c;
        }

        dij(); //  cout<<1<<endl;

        memcpy(p,d,sizeof(d));
       // for(int i=1;i<=n;i++)
           // cout<<p[i]<<' ';
        //cout<<endl;
        for(int i=1;i<=n;i++)
            for(int j=i+1;j<=n;j++)
        {
            int t=G[i][j];
            G[i][j]=G[j][i];
            G[j][i]=t;
        }
        dij();
        //for(int i=1;i<=n;i++)
            //cout<<d[i]<<' ';
        //cout<<endl;
        int ans=-1;
        for(int i=1;i<=n;i++)
        {
            if(i!=s)
               ans=max(ans,d[i]+p[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}