poj 3268 Silver Cow Party 最短路

题目链接：点击打开链接

Silver Cow Party

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 26082		Accepted: 11917

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

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.

题意：给你n个点，m条单向边，位置x，求的是所有点到x并回到自身的距离的最短距离的最大值，但是限制条件是

一条路不能走两遍。

题解：迪杰斯特拉分别跑位置i到x，x到i的最短路径，但是跑的时候要注意记录路径，跑完的时候对路径的点进行标记，

标记为已访问。最后统计最大值。

AC代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>

using namespace std;

const int maxn = 1010;
const int INF = 0x3f3f3f3f;

typedef pair <int,int> P;
int n,m,x;
vector <P> E[maxn];
long long d[maxn];
bool vis[maxn][maxn];
int pre[maxn];

int dj(int s,int e)
{
    priority_queue <P> que;
    que.push(P(-d[s],s));
    d[s]=0;
    pre[s]=0;
    while(!que.empty())
    {
        int now=que.top().second;
        que.pop();
        for(int i=0;i<E[now].size();i++)
        {
            int v=E[now][i].first;
            if(d[v]>d[now]+E[now][i].second&&!vis[now][i])
            {
                d[v]=d[now]+E[now][i].second;
                pre[v]=now;
                que.push(P(-d[v],v));
            }
        }
    }
    int root=pre[e];
    while(root!=0)
    {
        int tmp=pre[root];
        vis[tmp][root]=true;
        root=tmp;
    }
    return d[e];
}

int main()
{
    scanf("%d%d%d",&n,&m,&x);
    int u,v,w;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&u,&v,&w);
        E[u].push_back(P(v,w));
    }
    memset(dis,0,sizeof(dis));
    long long ans=0;
    for(int i=1;i<=n;i++)
    {
        if(i==x) continue;
        long long tmp=0;
        memset(vis,false,sizeof(vis));
        memset(d,INF,sizeof(d));
        tmp+=dj(i,x);
        memset(d,INF,sizeof(d));
        tmp+=dj(x,i);
        ans=max(ans,tmp);
    }
    printf("%lld\n",ans);
    return 0;
}