POJ 3268 Silver Cow Party（最短路dijkstra）

最新推荐文章于 2021-04-01 18:48:34 发布

Algobird

最新推荐文章于 2021-04-01 18:48:34 发布

阅读量454

点赞数

分类专栏：最短路

本文链接：https://blog.csdn.net/u012762625/article/details/42373307

版权

最短路专栏收录该内容

12 篇文章 0 订阅

订阅专栏

本文介绍了一道经典的最短路径问题——SilverCowParty。题目要求计算每头牛参加派对并返回农场所需的最长总时间。通过两次使用Dijkstra算法分别求得从各农场到派对地点及返回的最短路径，进而找到最大总时间。

摘要由CSDN通过智能技术生成

Silver Cow Party

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 13242		Accepted: 5958

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

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.

Source

USACO 2007 February Silver

解题报告：题意抽象出来意思是给一个有向图，然后求所有点经过v点，再回到原点的所有最短路径中最长的一条。解题方法就是用两个dijkstra，分别求i到v的最短距离和v到i的最短距离，然后找出最大的即可。

/********************************/
/*Problem:      POJ 3268        */
/*User:         shinelin        */
/*Memory:       4152K           */
/*Time:         63MS            */
/*Language:     C++             */
/********************************/
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <cstring>
#include <string>
#include <list>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <vector>
#include <set>
#include <algorithm>
#include <cmath>
using namespace std;

#define INF 0x7fffffff
#define LL long long
#define MAXN 1005

int n, m, v;
int tab[MAXN][MAXN];
int Go[MAXN];
int Back[MAXN];


void dijkstra()
{
    int s1[MAXN], s2[MAXN];
    int Min1 = INF, Min2 = INF, u1, u2;

    for(int i = 1; i <= n; i ++)
    {
        Go[i] = tab[i][v];
        Back[i] = tab[v][i];
        s1[i] = 0;
        s2[i] = 0;
    }

    s1[v] = s2[v] = 1;

    for(int i = 1; i <= n; i ++)
    {
        Min1 = Min2 = INF;

        for(int j = 1; j <= n; j ++)
        {
            if(!s1[j] && Go[j] < Min1)
            {
                Min1 = Go[j];
                u1 = j;
            }

            if(!s2[j] && Back[j] < Min2)
            {
                Min2 = Back[j];
                u2 = j;
            }
        }

        s1[u1] = 1;
        s2[u2] = 1;

        for(int j = 1; j <= n; j ++)
        {
            if(!s1[j] && tab[j][u1] != INF && tab[j][u1] + Go[u1] < Go[j])
            {
                Go[j] = Go[u1] + tab[j][u1];
            }

            if(!s2[j] && tab[u2][j] != INF && Back[u2] + tab[u2][j] < Back[j])
            {
                Back[j] = Back[u2] + tab[u2][j];
            }
        }
    }

    int Maxdist = 0;

    for(int i = 1; i <= n; i ++)
    {
        if(Go[i] + Back[i] > Maxdist)
        {
            Maxdist = Go[i] + Back[i];
        }
    }

    printf("%d\n", Maxdist);

}
int main()
{
    int x, y, c;
    scanf("%d%d%d", &n, &m, &v);

    for(int i = 1; i <= n; i ++)
    {
        for(int j = i + 1; j <= n; j ++)
        {
            tab[i][j] = tab[j][i] = INF;
            tab[i][i] = 0;
        }
    }

    for(int i = 0; i < m; i ++)
    {
        scanf("%d%d%d", &x, &y, &c);
        tab[x][y] = min(tab[x][y], c);
    }

    dijkstra();
    return 0;
}