POJ 3268 dijkstra()正反矩阵

原创 2012年03月21日 09:57:14

       dijkstra的裸题,正反矩阵各求一遍即可。。。题目:

Silver Cow Party
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 7988   Accepted: 3538

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: NM, and X 
Lines 2..M+1: Line i+1 describes road i with three space-separated integers: AiBi, 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
ac代码:

#include <iostream>
#include <cstdio>
#include <string.h>
const int N=1010;
int nfarm,npath,pos;
int map1[N][N],map2[N][N],visted[N];
int dis1[N],dis2[N];
#define MAX 0x7fffffff
void dijkstra(int dis[N],int map[N][N]){
  memset(visted,0,sizeof(visted));
  for(int i=1;i<=nfarm;++i)
	  dis[i]=map[pos][i];
  dis[pos]=0;
  visted[pos]=1;
  int newpos=pos;
  for(int i=1;i<=nfarm;++i){
	  for(int j=1;j<=nfarm;++j){
		  if(!visted[j]&&map[newpos][j]!=MAX&&dis[newpos]+map[newpos][j]<dis[j]){
		    dis[j]=dis[newpos]+map[newpos][j];
		  }
	  }
	  int mmin=MAX;
	  for(int j=1;j<=nfarm;++j){
		  if(!visted[j]&&mmin>dis[j]){
		    mmin=dis[j];
			newpos=j;
		  }
	  }
	  visted[newpos]=1;
  }
}
int main(){
	//freopen("11.txt","r",stdin);
	while(~scanf("%d%d%d",&nfarm,&npath,&pos)){
	  int x,y,z;
	  for(int i=0;i<=nfarm;++i){
		  for(int j=0;j<=nfarm;++j){
		    map1[i][j]=MAX;
			map2[i][j]=MAX;
		  }
	  }
	  while(npath--){
	    scanf("%d%d%d",&x,&y,&z);
		map1[x][y]=z;
		map2[y][x]=z;
	  }
	  dijkstra(dis1,map1);
	  dijkstra(dis2,map2);
	  int mmax=0;
	 /* for(int i=1;i<=nfarm;++i){
	    printf("%d ",dis1[i]);
	  }*/
	  for(int i=1;i<=nfarm;++i){
	    if(dis1[i]+dis2[i]>mmax)
			mmax=dis1[i]+dis2[i];
	  }
	  printf("%d\n",mmax);
	}
  return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

poj 3268 spfa 和dijkstra堆优化 +矩阵逆转。

ps 这道题用floyd准超时。 所以只能用spfa

POJ 3268 Silver Cow Party(dijkstra+矩阵转置)

n头牛要到达某一个点X,然后再返回到原来的位置。同时要求对于每头牛路径必须是最短的,而且去的路和回来的路不一样。求这些牛所花费的最长时间。

POJ 3268 Silver Cow Party(Dijkstra)

POJ 3268 Silver Cow Party(Dijkstra) http://poj.org/problem?id=3268 题意:有N头牛要去参加牛X那里的聚会,现在除了X牛外,其他N-1头...

POJ 3268 dijkstra算法

是一道最短路的题,先求目的点到个点的最短路,再把图反向,再求最短路即可。只是反向图的时候要注意一下,我就是这里犯错了,纠结了大概两个小时,,,题目: Silver Cow Party ...

POJ 3268 Silver Cow Party 最短路—dijkstra算法的优化。

POJ 3268 Silver Cow Party Description One cow from each of N farms (1 ≤ N ≤ 1000) convenient...

POJ3268 Silver Cow Party(dijkstra,spfa)

题目: Silver Cow Party Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 20481 ...

POJ 3268 Silver Cow Party (单源最短路Dijkstra+反向构图)

题目链接POJ3268题目大意给定一个有N(1≤\leN≤\le1000)个结点、M(1≤\leM≤\le10510^5)条单向边的有向正权图,求每个结点出发到X号结点再回来到初始位置的花费的最小值。...

POJ 3268 Silver Cow Party 最短路 dijkstra

题目链接: PO—3268 Silver Cow Party 题目大意: 给一个有向图,求所有点经过定点s在回到自身的最短路中的最大距离。 题目分析: 先求从s出发的最短路,然后把所有边反向,再求...

poj 3268 Silver Cow Party 【最短路Dijkstra + 结构体妙用】

Silver Cow Party Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %I64d & ...

poj 3268 Silver Cow Party dijkstra基础题!!!入门

双向dijkstra,一遍正续dijkstra,再将路向倒过来dijkstra,这道题我已开始定义最大值0x7FFFFFFF这顿wa,改成0x7FFFFF就过了,原来0x7FFFFFFF在比较的时候d...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)