关闭

POJ 3268 Silver Cow Party (来回最短路 SPFA)

标签: POJ最短路SPFA
822人阅读 评论(0) 收藏 举报
分类:

Silver Cow Party
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 14384   Accepted: 6490

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 ≤XN). A total ofM (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; roadi requiresTi (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, andX
Lines 2..M+1: Line i+1 describes road i with three space-separated integers:Ai,Bi, andTi. The described road runs from farmAi to farmBi, requiringTi 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


题目链接:http://poj.org/problem?id=3268


题目大意:奶牛聚会,求所有奶牛从自己农场到目标农场再回到自己农场的最短路中的最大值,路是单向的


题目分析:与POJ 1511类似,从自己到目标农场进行n-1次SPFA,记录每个dis[x],然后一次SPFA(x),记录每个dis[i],最后两个值加起来取大即可,复杂度O(nm)感觉过不了,可是300ms+过了


代码:

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
int const INF = 0x3fffffff;
int const MAX = 1005;
int dis[MAX], re1[MAX], re2[MAX];
bool vis[MAX];
int n, m, x;

struct EGDE
{
    int u, v, t;
}e[MAX * MAX / 2];

struct NODE
{
    int v, t;
    NODE(int vv, int tt)
    {
        v = vv;
        t = tt;
    }
};

vector <NODE> vt[MAX];

void SPFA(int v0)
{
    for(int i = 1; i <= n; i++)
        dis[i] = INF;
    dis[v0] = 0;
    queue <int> q;
    q.push(v0);
    memset(vis, false, sizeof(vis));
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = false;
        int sz = vt[u].size();
        for(int i = 0; i < sz; i++)
        {
            int v = vt[u][i].v;
            int t = vt[u][i].t;
            if(dis[v] > dis[u] + t)
            {
                dis[v] = dis[u] + t;
                if(!vis[v])
                {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    return;
}

int main()
{
    for(int i = 0; i <= n; i++)
        vt[i].clear();
    scanf("%d %d %d", &n, &m, &x);
    for(int i = 0; i < m; i++)
        scanf("%d %d %d", &e[i].u, &e[i].v, &e[i].t);
    for(int i = 0; i < m; i++)
        vt[e[i].u].push_back(NODE(e[i].v, e[i].t));
    for(int i = 1; i <= n; i++)
    {
        if(i == x)
        {
            continue;
            re1[i] = 0;
        }
        SPFA(i);
        re1[i] = dis[x];
    }
    SPFA(x);
    for(int i = 1; i <= n; i++)
        re2[i] = dis[i];
    int ans = 0;
    for(int i = 1; i <= n; i++)
        ans = max(ans, re1[i] + re2[i]);
    printf("%d\n", ans);
}



0
0
查看评论

POJ-3268-Silver Cow Party(迪杰斯特拉 多点到star和star到多点)

D - Silver Cow Party Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 3268 Appoint descript...
  • qq_32680617
  • qq_32680617
  • 2016-07-16 16:00
  • 288

poj3268 - Silver Cow Party

想看更多的解题报告: http://blog.csdn.net/wangjian8006/article/details/7870410              &...
  • wangjian8006
  • wangjian8006
  • 2012-08-16 10:20
  • 3164

poj 3268 Silver Cow Party(最短路+SPFA)

Silver Cow Party Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 9514   Accepted: 4263 ...
  • nealgavin
  • nealgavin
  • 2013-02-27 20:49
  • 375

POJ 3268 Silver Cow Party (Dijkstra_来回)

Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party ...
  • h1021456873
  • h1021456873
  • 2016-11-05 20:28
  • 145

POJ 3268 Silver Cow Party(找最短路径的最大值+两次Dijkstra算法)

这道题是今下午练习赛的题目,感觉题目很好。       题意大致是,每头牛要从起点去终点,再从终点回到起点,并且从起点到终点和从终点到起点为单向路径,求所有牛里面 起点到终点+终点到起点 的最短路径里面最大值为多少。   &#...
  • qq_35739903
  • qq_35739903
  • 2017-08-22 20:00
  • 98

poj 3268 Silver Cow Party (spfa )

Silver Cow Party Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 12913   Accepted: 5778 Descript...
  • u011721440
  • u011721440
  • 2014-09-02 19:36
  • 551

poj 3268 Silver Cow Party(SPFA)

...
  • xinag578
  • xinag578
  • 2015-06-14 11:41
  • 418

Silver Cow Party - POJ 3268 spfa

Silver Cow Party Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 13006   Accepted: 5824 ...
  • u014733623
  • u014733623
  • 2014-10-01 14:04
  • 386

Poj 3268 Silver Cow Party【SPFA】

Silver Cow Party Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 17517   A...
  • mengxiang000000
  • mengxiang000000
  • 2016-06-19 16:35
  • 503

poj Silver Cow Party 3268 (来回单向最短路)好题

Silver Cow Party Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 16996   Accepted: 7756 Description ...
  • yanghui07216
  • yanghui07216
  • 2016-03-27 21:13
  • 166
    个人资料
    • 访问:742189次
    • 积分:15324
    • 等级:
    • 排名:第877名
    • 原创:818篇
    • 转载:7篇
    • 译文:0篇
    • 评论:122条
    博客专栏