Cow Hurdles
2015-08-19 10:38
176 查看
Description
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.
Input
* 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
Output
* 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.
Sample Input
Sample Output
题解:求所有路径中的最大值中最小的一个,由于是求任意两点,所以用floyd。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int INF = 0x3fffffff;
int d[330][330];
int max(
4000
int a,int b)
{
return a > b ? a : b;
}
void floyd(int n)
{
for(int k = 1;k <= n;k++)
{
for(int i = 1;i <= n;i++)
{
for(int j = 1; j <= n;j++)
{
if(d[i][k] < d[i][j] && d[k][j] < d[i][j]) //找到i->j路径小的
{
d[i][j] = max(d[k][j],d[i][k]);
}
}
}
}
}
int main()
{
int n,m,t;
while(scanf("%d%d%d",&n,&m,&t) != EOF)
{
for(int i = 1; i <= n;i++)
{
for(int j = 1;j <= n;j++)
{
if(i == j)
{
d[i][j] = 0;
}
else
{
d[i][j] = INF;
}
}
}
int u,v,h;
for(int i = 0;i < m;i++)
{
scanf("%d%d%d",&u,&v,&h);
d[u][v] = h;
}
floyd(n);
for(int i = 0;i < t;i++)
{
scanf("%d%d",&u,&v);
if(d[u][v] == INF)
{
printf("-1\n");
}
else
{
printf("%d\n",d[u][v]);
}
}
}
return 0;
}
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.
Input
* 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
Output
* 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.
Sample Input
5 6 3 1 2 12 3 2 8 1 3 5 2 5 3 3 4 4 2 4 8 3 4 1 2 5 1
Sample Output
4 8 -1
题解:求所有路径中的最大值中最小的一个,由于是求任意两点,所以用floyd。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int INF = 0x3fffffff;
int d[330][330];
int max(
4000
int a,int b)
{
return a > b ? a : b;
}
void floyd(int n)
{
for(int k = 1;k <= n;k++)
{
for(int i = 1;i <= n;i++)
{
for(int j = 1; j <= n;j++)
{
if(d[i][k] < d[i][j] && d[k][j] < d[i][j]) //找到i->j路径小的
{
d[i][j] = max(d[k][j],d[i][k]);
}
}
}
}
}
int main()
{
int n,m,t;
while(scanf("%d%d%d",&n,&m,&t) != EOF)
{
for(int i = 1; i <= n;i++)
{
for(int j = 1;j <= n;j++)
{
if(i == j)
{
d[i][j] = 0;
}
else
{
d[i][j] = INF;
}
}
}
int u,v,h;
for(int i = 0;i < m;i++)
{
scanf("%d%d%d",&u,&v,&h);
d[u][v] = h;
}
floyd(n);
for(int i = 0;i < t;i++)
{
scanf("%d%d",&u,&v);
if(d[u][v] == INF)
{
printf("-1\n");
}
else
{
printf("%d\n",d[u][v]);
}
}
}
return 0;
}
相关文章推荐
- Basic Calculator
- Activity被回收导致fragment的getActivity为null的解决办法
- [iOS]CoreText 学习笔记(1)
- Linq中使用Left Join
- 剑指offer——面试题26:复杂链表的复制
- 解决SQL Server无法启动的小技巧
- 最新版ffmpeg源码分析二:transcode()函数
- poj3296--Rinse(三分)
- 关于对象实例序列化加密解密并写入文件的技巧
- Linux 信号列表
- 经典SQL语句大全(基础篇)
- 一个例子说明虚函数
- React-Knockout无缝粘合,JavaScript项目MVVM框架下的控件化
- av_read_frame 连续读包出现EOF的问题
- Web前端代码规范与页面布局
- jquery unbind 和off的区别(转)
- UVA196-Spreadsheet(拓扑排序)
- linux配置java环境变量(详细)
- [HDOJ1695]GCD
- 8月第2周全球域名商(国际域名)新增注册量TOP15