洛谷P2888 [USACO07NOV] Cow Hurdles S

Cow

题目描述

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 stations, conveniently labeled 1,…,𝑁1,…,N. A set of 𝑀M one-way paths connects pairs of stations; the paths are also conveniently labeled 1,…,𝑀1,…,M. Path 𝑖i travels from station 𝑆𝑖Si​ to station 𝐸𝑖Ei​ and contains exactly one hurdle of height 𝐻𝑖Hi​. Cows must jump hurdles in any path they traverse.

The cows have 𝑇T tasks to complete. Task 𝑖i comprises two distinct numbers, 𝐴𝑖Ai​ and 𝐵𝑖Bi​, 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.

Farmer John 想让她的奶牛准备郡级跳跃比赛，Bessie 和她的伙伴们正在练习跨栏。她们很累，所以她们想消耗最少的能量来跨栏。 显然，对于一头奶牛跳过几个矮栏是很容易的，但是高栏却很难。于是，奶牛们总是关心路径上最高的栏的高度。

奶牛的训练场中有 N 个站台，分别标记为 1,…,N。所有站台之间有 M 条单向路径，第 i 条路经是从站台 Si​ 开始，到站台 Ei​，其中最高的栏的高度为 Hi​。无论如何跑，奶牛们都要跨栏。

奶牛们有 T 个训练任务要完成。第 i 个任务包含两个数字 Ai​ 和 Bi​，表示奶牛必须从站台 Ai​ 跑到站台 Bi​，可以路过别的站台。奶牛们想找一条路径从站台 Ai​ 到站台 Bi​，使路径上最高的栏的高度最小。 你的任务就是写一个程序，计算出路径上最高的栏的高度的最小值。

输入格式

* Line 11: Three space-separated integers: 𝑁N, 𝑀M, and 𝑇T

* Lines 2,…,𝑀+12,…,M+1: Line 𝑖+1i+1 contains three space-separated integers: 𝑆𝑖Si​ , 𝐸𝑖Ei​ , and 𝐻𝑖Hi​

* Lines 𝑀+2,…,𝑀+𝑇+1M+2,…,M+T+1: Line 𝑖+𝑀+1i+M+1 contains two space-separated integers that describe task 𝑖i: 𝐴𝑖Ai​ and 𝐵𝑖Bi​

第一行：三个空格隔开的整数 N,M,T。

接下来 M 行：第 i 行包含三个空格隔开的整数Si​,Ei​,Hi​。

接下来 T 行：第 i 行包含两个空格隔开的整数，表示任务 i 的起始站台和目标站台 Ai​,Bi​。

输出格式

* Lines 1,…,𝑇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.

𝑇T 行：第 i 行为一个整数，表示任务 i 路径上最高的栏的高度的最小值。如果无法到达，输出 -1。

输入输出样例

输入 #1复制

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

输出 #1复制

4
8
-1

说明/提示

对于 100% 的数据，1≤N≤300，1≤M≤2.5×10^4，1≤Hi​≤1×10^6，1≤𝑇≤4×1041≤T≤4×104，1≤Ai​,Bi​≤N。

感谢 @gaozhiyong @Cppsteve 提供翻译

代码：

1.floyd 

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,m,t;
int dis[310][310];//掉的第一个坑，数组开太大无法编译 
void floyd(){//模板+小改 
	for(int k = 1;k<=n;k++){
		for(int i = 1;i<=n;i++){
			for(int j = 1;j<=n;j++){//!!!
				dis[i][j]=min(dis[i][j],max(dis[i][k],dis[k][j]));
			}
		}
	}
}
signed main(){
	cin >> n >> m >> t;
	for(int i = 1;i<=n;i++){//初始化 
		for(int j = 1;j<=n;j++){
			dis[i][j]=1e18;
			if(i==j) dis[i][j]=0;
		}
	}
	for(int i = 1;i<=m;i++){
		int s,e,h;
		cin >> s >> e >> h;
		dis[s][e]=h;//存图 
	}
	floyd();
	for(int i = 1;i<=t;i++){
		int a,b;
		cin >> a >> b;
		if(dis[a][b]!=1e18) cout << dis[a][b]<<"\n";//判断能否到达 
		else cout << -1<<"\n";//掉的第二个坑，忘记换行错了三个点 
	}
	return 0;
}

 2.二分(会有几个点超时，5个左右)

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,T;
int A,B;
int dis[310];
bool vis[310];
vector<pair<int,int>> e[310];
int check(int mid){
	for(int i=1;i<=n;i++) dis[i] = 1e18;
	queue<int > q;
	q.push(A);
	dis[A] = 0;
	vis[A] = 1;
	while(q.size()){
		auto now = q.front();
		q.pop();
		vis[now] = 0;
		for(auto t:e[now]){
			int spot = t.first,w = t.second;
			if(w<=mid&&dis[spot]==1e18){
				dis[spot] = 0;
				if(vis[spot]==0){
					vis[spot] = 1;
					q.push(spot);
				} 
			}
		}
	}
	if(dis[B]==1e18) return false;
	else return true;
}
signed main(){
	cin>>n>>m>>T;
	while(m--){
		int a,b,c;
		cin>>a>>b>>c;
		e[a].push_back({b,c});
	}
	for(int i = 1;i<=T;i++){
		cin>>A>>B;
		int l = 1,r = 1e6;
		while(l<r){
			int mid = (l+r)/2;
			if(check(mid)) r = mid;
			else l = mid+1;
 		}
 		if(check(l)) cout<<l<<"\n";
 		else cout<<-1<<"\n";
	}
	return 0;
}