# POJ 3268 Silver Cow Party (来回最短路 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

#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

个人资料
• 访问：742189次
• 积分：15324
• 等级：
• 排名：第877名
• 原创：818篇
• 转载：7篇
• 译文：0篇
• 评论：122条
博客专栏
 LeetCode 文章：135篇 阅读：78039
 Java学习笔记 文章：10篇 阅读：11230
 算法题 文章：50篇 阅读：33955
阅读排行