poj3268 Silver Cow Party DIJ

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.

题目链接

http://poj.org/problem?id=3268

题意

有N个点，M条边，X是终点
给出M条边长，组成有向图。
问各个点到达终点，再返回，最短路，求花费时间最长的最短路，如果没有路能让他走一个来回，就不予考虑。

思路

用dijkstra只能跑，以终点为起点的返程最短路。这时候，就要把存图的【i】【j】反过来变成【j】【i】
这时候，本来是由各个点到终点的图【各个点】【终点】，就变成了终点到各个点的图【终点】【各个点】
秒啊

两次dijkstra就出来了

直接一次次跑的话就T了。

TLE

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int a[1005][1005];
int dis[1005],book[1005];
int n,m,x,y,Min,v,j,u,lenth,start,ans;
int dij(int st){
int flag[1005]={0};
int to[1005]={0};
flag[st]=1;
for(int i = 1;i <= n;i++)to[i] = a[st][start];
for(int i = 1;i <= n - 1;i++){
	Min = 0x3f3f3f3f;
	for(j = 1;j <= n;j++){
		if(!flag[j]&&to[j]<Min){
			Min = to[j];
			u = j;
			}
		}
		flag[u] = 1;
		for(v = 1;v <= n;v++){
			if(a[u][v] <  0x3f3f3f3f){
				if(to[v] > to[u] + a[u][v])
					to[v] = to[u] + a[u][v];
				}
			}
	}
if(to[start]==0x3f3f3f3f)return -99999999;
return to[start];
}
int main(){
memset(a,0x3f3f3f3f,sizeof(a));
scanf("%d %d %d",&n,&m,&start);
book[start] = 1;
for(int i = 1;i <= n;i++) 
a[i][i] = 0;
for(int i = 1;i <= m;i++){
	scanf("%d %d",&x,&y);
scanf("%d",&lenth);
if(lenth < a[x][y]) a[x][y] = lenth;
}
for(int i = 1;i <= n;i++){
dis[i] = a[start][i];
}
for(int i = 1;i <= n - 1;i++){
	Min = 0x3f3f3f3f;
	for(j = 1;j <= n;j++){
		if(book[j] == 0&&dis[j] < Min){
			Min = dis[j];
			u = j;
			}
		}
		book[u] = 1;
		for(v = 1;v <= n;v++){
			if(a[u][v] <  0x3f3f3f3f){
				if(dis[v] > dis[u] + a[u][v])
					dis[v] = dis[u] + a[u][v];
				}
			}
	}
	for(int i = 1;i <= n;i++){
		if(i==start)continue;
		if(dis[i]==0x3f3f3f3f)dis[i]=-99999999;
		//printf("dis[%d] = %d  dij(%d) = %d\n",i,dis[i],i,dij(i));
		ans = max(dis[i]+dij(i),ans);
		}
			printf("%d\n",ans);
return 0;
}

AC code

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int a[1005][1005];
int dis[1005],book[1005];
int to[1005]={0};
int n,m,x,y,Min,v,j,u,lenth,start,ans;
void dij(){
int flag[1005]={0};
flag[start]=1;
for(int i = 1;i <= n;i++)to[i] = a[start][i];
for(int i = 1;i <= n - 1;i++){
	Min = 0x3f3f3f3f;
	for(j = 1;j <= n;j++){
		if(!flag[j]&&to[j]<Min){
			Min = to[j];
			u = j;
			}
		}
		flag[u] = 1;
		for(v = 1;v <= n;v++){
			if(a[u][v] <  0x3f3f3f3f){
				if(to[v] > to[u] + a[u][v])
					to[v] = to[u] + a[u][v];
				}
			}
	}
}
int main(){
memset(a,0x3f3f3f3f,sizeof(a));
scanf("%d %d %d",&n,&m,&start);
book[start] = 1;
for(int i = 1;i <= n;i++) 
a[i][i] = 0;
for(int i = 1;i <= m;i++){
scanf("%d %d",&x,&y);
scanf("%d",&lenth);
if(lenth < a[x][y]) a[x][y] = lenth;
}
for(int i = 1;i <= n;i++){
dis[i] = a[start][i];
}
for(int i = 1;i <= n - 1;i++){
	Min = 0x3f3f3f3f;
	for(j = 1;j <= n;j++){
		if(book[j] == 0&&dis[j] < Min){
			Min = dis[j];
			u = j;
			}
		}
		book[u] = 1;
		for(v = 1;v <= n;v++){
			if(a[u][v] <  0x3f3f3f3f){
				if(dis[v] > dis[u] + a[u][v])
					dis[v] = dis[u] + a[u][v];
				}
			}
	}
	for(int i = 1;i <= n;i++){
		for(int kk = 1;kk <= i;kk++){
			swap(a[i][kk],a[kk][i]);
			}
		}
	dij();
	for(int i = 1;i <= n;i++){
		if(i==start)continue;
		if(dis[i]==0x3f3f3f3f)dis[i]=-99999999;
		if(to[i]==0x3f3f3f3f)to[i]=-99999999;
		//printf("dis[%d] = %d  dij(%d) = %d\n",i,dis[i],i,dij(i));
		ans = max(dis[i]+to[i],ans);
		}
			printf("%d\n",ans);
return 0;
}