Cow Hurdles(floyd)
来源:互联网 发布:淘宝91邀请码多少钱 编辑:程序博客网 时间:2024/05/01 10:35
Cow Hurdles
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 50 Accepted Submission(s) : 35
Farmer John wants the cows to prepare for the county jumping competition, so Bessie and the gang are practicing jumping over hurdles. They are getting tired, though, so they want to be able to use as little energy as possible to jump over the hurdles.
Obviously, it is not very difficult for a cow to jump over several very short hurdles, but one tall hurdle can be very stressful. Thus, the cows are only concerned about the height of the tallest hurdle they have to jump over.
The cows' practice room has N (1 ≤ N ≤ 300) stations, conveniently labeled 1..N. A set of M (1 ≤ M ≤ 25,000) one-way paths connects pairs of stations; the paths are also conveniently labeled 1..M. Path i travels from station Si to station Ei and contains exactly one hurdle of height Hi (1 ≤ Hi ≤ 1,000,000). Cows must jump hurdles in any path they traverse.
The cows have T (1 ≤ T ≤ 40,000) tasks to complete. Task i comprises two distinct numbers, Ai and Bi (1 ≤ Ai ≤ N; 1 ≤ Bi ≤ N), which connote that a cow has to travel from station Ai to station Bi (by traversing over one or more paths over some route). The cows want to take a path the minimizes the height of the tallest hurdle they jump over when traveling from Ai to Bi . Your job is to write a program that determines the path whose tallest hurdle is smallest and report that height.
* Line 1: Three space-separated integers: N, M, and T
* Lines 2..M+1: Line i+1 contains three space-separated integers: Si , Ei , and Hi
* Lines M+2..M+T+1: Line i+M+1 contains two space-separated integers that describe task i: Ai and Bi
* Lines 1..T: Line i contains the result for task i and tells the smallest possible maximum height necessary to travel between the stations. Output -1 if it is impossible to travel between the two stations.
5 6 31 2 123 2 81 3 52 5 33 4 42 4 83 41 25 1
48-1
#include<iostream>#include<cstdio>#include<cmath>#include<iomanip>#include<cstdlib>const int MAXN=300+5;#define INF 1.1e9using namespace std;long vis[MAXN];int map[MAXN][MAXN];int dis[MAXN];int point[MAXN];void floyd(int n){ int i,j,k,x; for(k=1;k<=n;k++) for(i=1;i<=n;i++) for(j=1;j<=n;j++){x=map[i][k]>map[k][j]?map[i][k]:map[k][j]; if(x<map[i][j]) map[i][j]=x;}}int main(){int n,m,r,a,b,i,j,c,x,y;while(~scanf("%d%d%d",&n,&m,&r)){//memset(map,0x3f,sizeof(map));for(i=0;i<n+2;i++)for(j=0;j<n+2;j++)map[i][j]=map[j][i]=INF;for(i=1;i<=m;i++){scanf("%d%d%d",&a,&b,&c);if(c<map[a][b])map[a][b]=c;}floyd(n);for(i=1;i<=r;i++){scanf("%d%d",&x,&y);printf("%d\n",map[x][y]<1.1e9?map[x][y]:-1);}}return 0;}
- Cow Hurdles(floyd)
- POJ 3615 Cow Hurdles (Floyd算法)
- POJ3615 Cow Hurdles FLOYD
- POJ3615 Cow Hurdles【Floyd】
- [floyd]POJ 3615 Cow Hurdles
- 最短路(floyd) Cow Hurdles
- poj 3615Cow Hurdles floyd
- Poj 3615 Cow Hurdles【Floyd】
- bzoj 1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏(floyd)
- bzoj1641 [Usaco2007 Nov]Cow Hurdles 奶牛跨栏(Floyd)
- poj 3615 :Cow Hurdles (floyd)----很好
- POJ 3615 Cow Hurdles(Floyd算法)
- poj Cow Hurdles floyd基础题!!!!
- POJ 3615 Cow Hurdles //Floyd算法
- bzoj 1641: Cow Hurdles 奶牛跨栏 floyd
- POJ 3615.Cow Hurdles【最短路(Floyd算法变形)】【4月14】
- Cow Hurdles
- POJ 3615 Cow Hurdles Floyd算法的变体
- Java: java.text.Format体系总结
- NSCopying协议
- 小而美的LBS应用龙门阵——成都开发者沙龙
- .net平台借助第三方推送服务在推送Android消息(极光推送)
- Asio 定时器
- Cow Hurdles(floyd)
- makefile
- IO忽略ssl
- 产生不相同的随机数
- WEP、WPA和WPA2的区别
- 谈谈我认识的Aurigma Upload Suite
- CCLuaObjcBridge调Objective-C方法传索引数组报invalid key to 'next'错调试
- SDWebImageManagerDelegate 协议参考
- kmp之我见