最短路径(4)--poj3268(dijkstra单源最短路径变形)

最新推荐文章于 2019-06-07 17:25:27 发布

原创最新推荐文章于 2019-06-07 17:25:27 发布 · 669 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#Dijkstra变形 #poj3268 #dijkstra #单源最短路径

【最短路径】专栏收录该内容

12 篇文章

订阅专栏

博客介绍了POJ3268问题，即求解所有牛参加聚会并返回农场的最长行走时间。每个牛需要找到到农场X的最短路径，然后返回自己的农场，问题是求最长的总时间。解决方案是使用Dijkstra算法变形，通过计算两次最短路径（一次从X到其他农场，另一次路径反转后再次计算），相加得到最长时间。

Silver Cow Party

Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu

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; roadi 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 farmA_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

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条边，接着是m条边，代表从牛a到牛b需要花费c时间，现在所有牛要到牛x那里去参加聚会，并且所有牛参加聚会后还要回来，给你牛x，除了牛x之外的牛，他们都有一个参加聚会并且回来的最短时间，从这些最短时间里找出一个最大值输出。

解题思路：最短路径只需要从x到i的最短路径代表他们返回的最短路径，然后将所有边反过来，再从x到i的最短路径代表他们来参加聚会的最短路径，这样对应相加找出一个最大值就可以了，当然其实不需要将所有边反过来，只需要将map的行和列对换一下就可以了，数据比较大，所以floyd超时，用dijkstra比较好点。代码如下：

#include <iostream>  
using namespace std;  
#define MAXV 1010  
#define inf 1<<29  
  
int map[MAXV][MAXV],d[MAXV],dback[MAXV];  
bool vis[MAXV];  
int n,m,x;  
  
int dijkstra(){  
      
    int i,j,v,mi;  
    for(i=1;i<=n;i++){  
        vis[i]=0;  
        d[i]=map[x][i];  
        dback[i]=map[i][x];  
    }  
      
    for(i=1;i<=n;i++){  
        mi=inf;  
        for(j=1;j<=n;j++)  
            if(!vis[j] && d[j]<mi){  
                v=j;  
                mi=d[j];  
            }  
            vis[v]=1;  
              
            for(j=1;j<=n;j++){  
                if(!vis[j] && map[v][j]+d[v]<d[j])  
                    d[j]=map[v][j]+d[v];  
            }  
    }  
      
    for(i=1;i<=n;i++) vis[i]=0;  
      
    for(i=1;i<=n;i++){  
        mi=inf;  
        for(j=1;j<=n;j++)  
            if(!vis[j] && dback[j]<mi){  
                v=j;  
                mi=dback[j];  
            }  
            vis[v]=1;  
              
            for(j=1;j<=n;j++){  
                if(!vis[j] && map[j][v]+dback[v]<dback[j])  
                    dback[j]=map[j][v]+dback[v];  
            }  
    }  
    mi=-1;  
    for(i=1;i<=n;i++){  
        if(d[i]+dback[i]>mi)  
            mi=d[i]+dback[i];  
    }  
    return mi;  
}  
  
int main(){  
    int i,a,b,c,j;  
    while(~scanf("%d%d%d",&n,&m,&x)){  
        for(i=1;i<=n;i++){  
            for(j=1;j<=n;j++)  
                if(i!=j) map[i][j]=inf;  
                else map[i][j]=0;  
        }  
          
        for(i=1;i<=m;i++){  
            scanf("%d%d%d",&a,&b,&c);  
            map[a][b]=c;  
        }  
          
        printf("%d\n",dijkstra());  
    }  
    return 0;  
}