2020ICPC上海 D Walker（思维、二分、三分）

链接

题目描述

As a world-famous traveler, Prof. Pang’s research interest is to travel as many places as possible in his life.

We have a segment $[0,n]$. There are two travelers on it. The first one is on position $p_1$ with velocity $v_1$ (which means s/he can walk $v_1$ unit on the segment per second). The second one is on position $p_2$ with velocity $v_2$ .

From their respective beginning points, travelers can walk on the segment. They cannot walk outside the segment. Whenever they want to change their direction, they can turn around immediately.

Please help Prof. Pang to calculate the minimum possible time by which every position of the segment is passed by at least one traveler.

输入描述:

The first line contains one integer test$(1\le test\le 10000)$ – the number of test cases.

The i-th of the next test lines contains five numbers $n,p_{1,i},v_{1,i},p_{2,i},v_{2,i}$ $(0<n\le 10000,0\le p_{1,i},p_{2,i}\le n$, $0.001\le v_{1,i},v_{2,i}\le 1000$. All numbers have at most $3$ digits after the decimal point.

输出描述:

For each test case, we should output one number – the minimum time that every position of the segment is passed by at least one traveler.

Your answer is considered correct if its absolute or relative error does not exceed $10^{-6}$.

输入

2
10000.0 1.0 0.001 9999.0 0.001
4306.063 4079.874 0.607 1033.423 0.847

输出

5001000.0000000000
3827.8370013755

思路

只有三种情况：

1. 一个人跑完全程
2. 左边的人走到右端，右边的人走到左端

3. 取 $p1$、$p2$ 中间某个点 $mid$ ，左边的人走区间 $[0,mid]$ ，右边的人走[mid,n]

前两种方法比较好计算。第三种方法可以用二分或者三分确定分割位置，从而计算出结果。

三分方法
在最优的分割点处，总时间最小；越是偏离最优点，总时间越长。单峰函数用三分确定极值。

二分方法
暂定一个分割点，计算左边的人用时 $t1$ 与右边的人用时 $t2$，若左边的人用时更久，那么分割点左移，否则分割点右移。

三分代码

#include<bits/stdc++.h>
using namespace std;
const double eps=1e-10;
const double eeps=1e-11;
int T;
double n,a,b,va,vb,ans;

double calc(double l,double r,double p,double v){
	double mn=min(r-p,p-l);
	return (mn+r-l)/v;
}

double f(double p){
	return max(calc(0,p,a,va),calc(p,n,b,vb));
}

void solve(){
	cin>>n>>a>>va>>b>>vb;
	if(a>b) swap(a,b),swap(va,vb);
	double l=a,r=b;
	while(r-l>eps){
		double mid=(l+r)/2;
		double midl=mid-eeps;
		double midr=mid+eeps;
		if(f(midl)>f(midr)) l=midl;
		else r=midr;
	}
	ans=f(l);		//情况(3)
	ans=min(ans,calc(0,n,a,va));	//情况(1)
	ans=min(ans,calc(0,n,b,vb));	//情况(1)
	ans=min(ans,max(calc(a,n,a,va),calc(0,b,b,vb)));	//情况(2)
	cout<<setprecision(10)<<fixed<<ans<<"\n";
}

int main(){
	for(cin>>T;T;T--) solve();
}

其中 double f(double p); 函数的功能为：返回 $[0,p]$ 区间全部由 $a$ 走完，$[p,n]$ 区间全部由 $b$ 走完，所用的最小时间。
double calc(double l,double r,double p,double v); 的功能是：返回当初始位置在 $p$ ，速度为 $v$ ，走完 $[l,r]$ 区间所用的最小时间。其中 $p\in [l,r]$。

二分代码

#include<bits/stdc++.h>
#define double long double
using namespace std;
int T;
double n,a,b,va,vb,ans;

double calc(double l,double r,double p,double v){
	double mn=min(r-p,p-l);
	return (mn+r-l)/v;
}

double f(double p){
	return max(calc(0,p,a,va),calc(p,n,b,vb));
}

bool check(double p){
	return calc(0,p,a,va)<calc(p,n,b,vb);
}

void solve(){
	cin>>n>>a>>va>>b>>vb;
	if(a>b) swap(a,b),swap(va,vb);
	double l=a,r=b;
	for(int i=0;i<100;i++){
		double mid=(l+r)/2;
		if(check(mid)) l=mid;
		else r=mid;
	}
	ans=f(l);
	ans=min(ans,calc(0,n,a,va));
	ans=min(ans,calc(0,n,b,vb));
	ans=min(ans,max(calc(a,n,a,va),calc(0,b,b,vb)));
	cout<<setprecision(10)<<fixed<<ans<<"\n";
}

int main(){
	for(cin>>T;T;T--) solve();
}

固定二分次数 $100$ 次，有着非常高的精度。