POJ3615 - Cow Hurdles - 最短路

最新推荐文章于 2022-09-03 22:32:12 发布

原创最新推荐文章于 2022-09-03 22:32:12 发布 · 336 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

最短路及其变形

本文介绍了一道经典的路径寻找问题CowHurdles，通过Floyd算法解决在有向图中寻找两点间路径上障碍高度最小的问题。文章提供了完整的代码实现。

1.题目描述：

Cow Hurdles

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7876		Accepted: 3524

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 S_i to station E_i and contains exactly one hurdle of height H_i (1 ≤ H_i ≤ 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, A_i and B_i (1 ≤ A_i ≤ N; 1 ≤ B_i ≤ N), which connote that a cow has to travel from station A_i to station B_i (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 A_i to B_i . 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: S_i , E_i , and H_i
* Lines M+2..M+T+1: Line i+M+1 contains two space-separated integers that describe task i: A_i and B_i

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

4
8
-1

Source

USACO 2007 November Silver

2.题意概述：

给你一个有向图,然后对于特定的点A与B,要你求出A到B之间所有可行路径的单段路距离最大值的最小值.(有点绕)

3.解题思路：

直接套floyd最好，最开始用bfs绕弯有点多gg

4.AC代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <functional>
#include <cmath>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <ctime>
#define INF 0x3f3f3f3f
#define maxn 100100
#define N 333
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
int mp[N][N];
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++)
				mp[i][j] = min(mp[i][j], max(mp[i][k], mp[k][j]));
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int t, n, m;
	while (~scanf("%d%d%d", &n, &m, &t))
	{
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				mp[i][j] = i == j ? 0 : INF;
		while (m--)
		{
			int u, v, h;
			scanf("%d%d%d", &u, &v, &h);
			mp[u][v] = h;
		}
		floyd(n);
		while (t--)
		{
			int a, b;
			scanf("%d%d", &a, &b);
			printf("%d\n", mp[a][b] == INF ? -1 : mp[a][b]);
		}
	}
#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}

标签

#acm #算法 #poj