题目:
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: N, M, and X
Lines 2..M+1: Line i+1 describes road i with three space-separated integers: Ai, Bi, 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.
题意是说有N头牛M条路,其中有一头牛举办party.其他牛通过对应的道路去参加party,完了又返回,它们都按照最短路径去和回,问每头牛来回所需时间的最大值。
这道题可以先求返回时各头牛的最短路径(返回时起点都是开party的点),但去party时由于起点不唯一(不是单源),因此不能直接求最短路径。但终点唯一,因此可以反向求出最短路径。
参考代码:
#include <iostream>
#include <algorithm>
#define N 2000
#define INF 99999
using namespace std;
int cost[N][N];
int cost2[N][N];
int d[N];
int d2[N];
bool used[N];
void dij(int x,int n,int d[],int cost[][N]) {
fill(d,d+N,INF);
fill(used,used+N,false);
d[x] = 0;
while (true) {
int v1 = -1;
for (int i = 1;i <= n;++i) {
if (!used[i] && (v1 == -1 || d[i] < d[v1])) v1 = i;
}
if (v1 == -1) break;
used[v1] = true;
for (int i = 1;i <= n;++i) {
d[i] = min(d[i],d[v1]+cost[v1][i]);
}
}
}
void costturn(int n,int cost[][N]) {
for (int i = 1;i <= n;++i) {
for (int j = 1;j <= n;++j) {
cost2[i][j] = INF;
}
}
for (int i = 1;i <= n;++i) {
for (int j = 1;j <= n;++j) {
cost2[i][j] = cost[j][i];
}
}
}
int maxtime(int d[],int d2[],int n) {
int maxt = d[1] + d2[1];
for (int i = 1;i <= n;++i) {
if (maxt < d[i]+d2[i]) maxt = d[i] + d2[i];
}
return maxt;
}
int main() {
int n,m,x;
while (cin >> n >> m >> x) {
for (int i = 0;i <= n;++i) {
for (int j = 0;j <= n;++j) {
cost[i][j] = INF;
}
}
int a,b,t;
for (int i = 0;i < m;++i) {
cin >> a >> b >> t;
cost[a][b] = t;
}
dij(x,n,d,cost);
costturn(n,cost);
dij(x,n,d2,cost2);
int maxt = maxtime(d,d2,n);
cout << maxt << endl;
}
return 0;
}