【POJ 3615】Cow Hurdles
2015-08-25 16:36
531 查看
Cow Hurdles
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
Source
USACO 2007 November Silver
裸的传递闭包啊啊啊。
醉了。。。不说了。我想静静。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6486 | Accepted: 2948 |
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
Source
USACO 2007 November Silver
裸的传递闭包啊啊啊。
醉了。。。不说了。我想静静。
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int MAXN = 305; int dis[MAXN][MAXN]; int n; int m; int t; int main() { memset(dis, 0x7f, sizeof(dis)); scanf("%d%d%d", &n, &m, &t); for (int i = 0; i < m; ++i) { int u; int v; int w; scanf("%d%d%d", &u, &v, &w); dis[u][v] = min(dis[u][v], w); } for (int k = 1; k <= n; ++k) for (int i = 1; i <= n; ++i) if (k != i) for (int j = 1; j <= n; ++j) if (k != j && i != j) dis[i][j] = min(dis[i][j], max(dis[i][k], dis[k][j])); while (t--) { int u; int v; scanf("%d%d", &u, &v); if (dis[u][v] > 1000000) printf("-1\n"); else printf("%d\n", dis[u][v]); } return 0; }
相关文章推荐
- Android meta-data(未完成)
- C#对Excel的操作
- LINUX 使用DBCA创建ORACLE数据库
- 显示Servlet API主要版本,次要版本以及服务器系统信息
- Hibernate + jbosstools 整合、配置、测试详解
- js,jquery错误总结(更新中)
- OpenStreetMap/Google/百度/Bing瓦片地图服务(TMS)
- Android 程序打包及签名
- android学习笔记5 - SharedPreferences数据存储技术
- Android反射
- service zabbix does not support chkconfig
- 基本内置类型中整型浮点型占多少字节
- 黑马程序员——Java基础---String类和对象包装类
- MyBatis学习 之 二、SQL语句映射文件(1)resultMap
- 06-图4. Saving James Bond - Hard Version (30)-DFS回溯
- Android SHA1与Package获取方式
- 我的插件のinput文本框实现宽度自适应
- 不可不知的:iOS开发的22个诡异技巧
- Linux_oracle命令大全(转)
- 机器学习--贝叶斯公式