关闭

poj 3268 单向最短路,来回路程~

192人阅读 评论(0) 收藏 举报
分类:
Silver Cow Party
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 17432   Accepted: 7993

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 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: NM, and X 
Lines 2..M+1: Line i+1 describes road i with three space-separated integers: AiBi, 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.

Source


题目大意:给出n个点和m条边,接着是m条边,代表从牛a到牛b需要花费c时间,现在所有牛要到牛x那里去参加聚会,并且所有牛参加聚会后还要回来,给你牛x,除了牛x之外的牛,他们都有一个参加聚会并且回来的最短时间,从这些最短时间里找出一个最大值输出

解题思路:最短路径只需要从x到i的最短路径代表他们返回的最短路径,然后将所有边反过来,再从x到i的最短路径代表他们来参加聚会的最短路径,这样对应相加找出一个最大值就可以了,当然其实不需要将所有边反过来,在dijkstra里面两次查询i到x最短路dis[i],和从x回到i的最短返回距离disf[i].
然后找出和的最大值即可~

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define N 1100
int n,m,x;
int dis[N],disf[N],maps[N][N],vis[N];

void init(int n)
{
    for(int i=0;i<=n;i++)
        for(int j=0;j<=n;j++)
           maps[i][j]=(i==j)?0:INF;
}

int dijkstra()
{
    int i,j,index,Min;
    for(i=1;i<=n;i++)
    {
        dis[i]=maps[i][x];  ///i到x的最短路~
        disf[i]=maps[x][i];  ///x返回i的最短路~
        vis[i]=0;
    }

    for(i=1;i<=n;i++)
    {
        Min=INF;
        for(j=1;j<=n;j++)
        {
            if(!vis[j] && Min>dis[j])
            {
                Min=dis[j];
                index=j;
            }
        }
        vis[index]=1;
        for(j=1;j<=n;j++)
        {
            if(!vis[j] && dis[j]>Min+maps[j][index])
                dis[j]=Min+maps[j][index];
        }
    }

    memset(vis,0,sizeof(vis));
    for(i=1;i<=n;i++)
    {
        Min=INF;
        for(j=1;j<=n;j++)
        {
            if(!vis[j] && Min>disf[j])
            {
                Min=disf[j];
                index=j;
            }
        }
        vis[index]=1;
        for(j=1;j<=n;j++)
        {
            if(!vis[j] && disf[j]>Min+maps[index][j])
                disf[j]=Min+maps[index][j];
        }
    }

    int Max=-1;
    for(i=1;i<=n;i++)
    {
        if(Max<dis[i]+disf[i])
            Max=dis[i]+disf[i];
    }
    return Max;
}

int main()
{
    int i,a,b,c,ans;
    while(scanf("%d%d%d",&n,&m,&x)!=EOF)
    {
        init(n);
        for(i=0;i<m;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            maps[a][b]=c;
        }
        ans=dijkstra();
        printf("%d\n",ans);
    }
    return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:54476次
    • 积分:3098
    • 等级:
    • 排名:第11610名
    • 原创:262篇
    • 转载:15篇
    • 译文:0篇
    • 评论:21条
    最新评论