Silver Cow Party 【双向最短路】

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.

来回是分开的，分别扫一遍记录就好
同一个起点，对于正向图来说，是求 所有点到起点的最短距离，对于反向图来说，是求将起点当作终点来求最短距离，，，

学习了
SPFA 时间真短 *
代码
第一种 SPFA 79ms

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<set>
#define CLR(a,b) memset((a),(b),sizeof(a))
#define inf 0x3f3f3f3f
#define mod 100009
#define LL long long
#define M  100000+100
#define ll o<<1
#define rr o<<1|1
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
using namespace std;
struct edge{int to,cost;};
vector<edge>G[M],GG[M];
int dis[M];
int diss[M];
int n,m; 
void init(){ for(int i=1;i<=n;i++) G[i].clear(),dis[i]=inf,diss[i]=inf,GG[i].clear();}
void getmap()
{
    int i,j;
    for(i=0;i<m;i++)   //  正向反向建建图 ** 重要 
    {
        int temp;edge e;int a;
        scanf("%d%d%d",&a,&e.to,&e.cost);
        G[a].push_back(e);
        temp=a;   **
        a=e.to;e.to=temp;
        GG[a].push_back(e);
    }
}
void spfa(int st,int *d,vector<edge> *G)  // 亮点
{
     d[st]=0;
    queue<int>Q;
    Q.push(st);
    while(!Q.empty())
    {
        int next=Q.front();Q.pop();
        for(int i=0;i<G[next].size();i++)
        {
            edge e=G[next][i];
            if(d[e.to]>d[next]+e.cost)
            {
                d[e.to]=d[next]+e.cost;
                Q.push(e.to);
            }
        }
    }
}
int num[M];
int main()
{
    int st,ed;
    scanf("%d%d%d",&n,&m,&st);
    init();
    getmap();
    spfa(st,dis,G);
    spfa(st,diss,GG);
    int i,j;
    for(i=1;i<=n;i++)
    num[i]=dis[i]+diss[i];

    sort(num+1,num+n+1);
    printf("%d\n",num[n]);
    return 0;
}

第二种 DJK 219 ms
代码

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<set>
#define CLR(a,b) memset((a),(b),sizeof(a))
#define inf 0x3f3f3f3f
#define mod 100009
#define LL long long
#define M  100000+100
#define ll o<<1
#define rr o<<1|1
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
using namespace std;
typedef struct pair<int ,int > P ;
struct  edge {int to,cost;} ;
int dis[M];
int diss[M];
vector<edge>G1[M],G2[M];
bool operator <  ( P a, P b)
{
    return a.first>b.first;
}

int n,m;
void init(){ for(int i=1;i<=n;i++) dis[i]=inf,diss[i]=inf,G1[i].clear(),G2[i].clear(); }
void getmap()
{
    int i,j;
    for(i=1;i<=m;i++)
    {
        int a;
        edge e;
        scanf("%d%d%d",&a,&e.to,&e.cost);
        G1[a].push_back(e);
        swap(e.to,a);
        G2[a].push_back(e);
    }
}
void djk(int st,int *d,vector <edge> *G)
{
    priority_queue<P>Q;
    d[st]=0;
    Q.push({0,st}) ;
    while(!Q.empty())
    {
        P now =Q.top();Q.pop();
        int value=now.first;int next=now.second;
        for(int i=0;i<G[next].size();i++)
        {
            edge e=G[next][i];
            if(d[e.to]>e.cost+d[next])
            {
                d[e.to]=e.cost+d[next];
                Q.push({d[e.to],e.to});
             } 
        }
    }
}
int num[M];
int main()
{
    int st;
    scanf("%d%d%d",&n,&m,&st);
    init();
    getmap();
    djk(st,dis,G1);
    djk(st,diss,G2);
    for(int i=1;i<=n;i++)
    {
        num[i]=dis[i]+diss[i];
     }
     sort(num+1,num+1+n);
     printf("%d\n",num[n]);
    return 0;
}