D - Silver Cow Party POJ - 3268
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条边,接着是m条边,代表从牛a到牛b需要花费c时间,现在所有牛要到牛x那里去参加聚会,并且所有牛参加聚会后还要回来,给你牛x,除了牛x之外的牛,他们都有一个参加聚会并且回来的最短时间,从这些最短时间里找出一个最大值输出。
思路:先对party在的地方进行dijkstra得到所以牛回家的最短距离,再将单向路反向,之后再次对party所在地dijkstra就得到了牛到party需要的时间了。两个答案累加求最大值。
.
.
堆优化的dijkstra(Time 172ms Memory 15960kB)
#include <iostream>
#include <queue>
#include <cstring>
#define inf 0x3f3f3f
using namespace std;
typedef struct node {
int v,date;
} ty;
bool operator < ( const ty &a, const ty &b )
{
return a.date>b.date;
}
int a[2002][2002];
int via[2002];
int dis[2002];
int ans[2002];
int n,m,k;
ty t,d;
void dijstra1( int v0 ) // 从v0到party
{
int i;
memset(via,0,sizeof(via));
priority_queue <ty> Q;
memset(dis,inf,sizeof(dis));
t.v = v0;
t.date = 0;
Q.push(t);
while ( !Q.empty() ) {
if ( via[Q.top().v]==1 ) {
Q.pop();
continue ;
}
t = Q.top();
int u = t.v;
dis[u] = t.date;
via[u] = 1;
for ( i=1; i<=n; i++ ) {
if ( via[i]==0 && a[u][i]<inf && dis[i]>dis[u]+a[u][i] ) {
dis[i] = dis[u]+a[u][i];
d.v = i;
d.date = dis[i];
Q.push(d);
}
}
}
for ( i=1; i<=n; i++ ) { // 将最短路径都存入ans数组里。
ans[i] += dis[i];
}
}
int main()
{
int i,j;
cin >> n >> m >> k;
memset(a,inf,sizeof(a));
memset(ans,0,sizeof(ans));
for ( i=1; i<=n; i++ ) {
a[i][i] = 0;
}
for ( i=1; i<=m; i++ ) {
int x,y,z;
cin >> x >> y >> z;
if ( a[x][y]>z ) {
a[x][y] = z;
}
}
dijstra1(k);
for ( i=1; i<=n; i++ ) {
for ( j=1; j<=n; j++ ) {
if ( i<j ) { // 遗漏了这个条件这两个for语句就白做了,ij换过来ji又换回去了
swap(a[i][j],a[j][i]);
}
}
}
dijstra1(k);
int maxx = 0;
for ( i=1; i<=n; i++ ) {
if ( ans[i]>maxx ) {
maxx = ans[i];
}
}
cout << maxx << endl;
return 0;
}
普通的dijkstra:(Time 188ms)
#include <iostream>
#include <queue>
#include <cstring>
#define inf 0x3f3f3f
using namespace std;
typedef struct node {
int v,date;
} ty;
bool operator < ( const ty &a, const ty &b )
{
return a.date>b.date;
}
int a[2002][2002];
int via[2002];
int dis[2002];
int ans[2002];
int n,m,k;
ty t,d;
void dijstra1( int v0 ) // 从v0到party
{
int i;
memset(via,0,sizeof(via));
for ( i=1; i<=n; i++ ) {
dis[i] = a[v0][i];
}
while ( 1 ) {
int minn = inf;
int u;
for ( i=1; i<=n; i++ ) {
if ( via[i]==0 && dis[i]<minn ) {
minn = dis[i];
u = i;
}
}
if ( minn==inf ) {
break ;
}
via[u] = 1;
for ( i=1; i<=n; i++ ) {
if ( via[i]==0 && a[u][i]<inf && dis[i]>dis[u]+a[u][i] ) {
dis[i] = dis[u]+a[u][i];
}
}
}
for ( i=1; i<=n; i++ ) { // 将最短路径都存入ans数组里。
ans[i] += dis[i];
}
}
int main()
{
int i,j;
cin >> n >> m >> k;
memset(a,inf,sizeof(a));
memset(ans,0,sizeof(ans));
for ( i=1; i<=n; i++ ) {
a[i][i] = 0;
}
for ( i=1; i<=m; i++ ) {
int x,y,z;
cin >> x >> y >> z;
if ( a[x][y]>z ) {
a[x][y] = z;
}
}
dijstra1(k);
for ( i=1; i<=n; i++ ) {
for ( j=1; j<=n; j++ ) {
if ( i<j ) { // 遗漏了这个条件这两个for语句就白做了,ij换过来ji又换回去了
swap(a[i][j],a[j][i]);
}
}
}
dijstra1(k);
int maxx = 0;
for ( i=1; i<=n; i++ ) {
if ( ans[i]>maxx ) {
maxx = ans[i];
}
}
cout << maxx << endl;
return 0;
}