题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=3695
题目分析:这里利用费马原理,我们知道这个最快方案一定是按照折射定律走的。由于初始角度与最终到达Y时的横坐标x成正比,所以我们可以利用二分法求解。
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<set>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
const double pi=acos(-1.0);
using namespace std;
const double eps=1e-12;
double ans;
int n,x;
int h[105],v[105];
inline int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){ if (ch=='-') f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
double cal(double t)
{
double sum=0;
ans=0;
for(int i=1;i<=n;i++)
{
sum+=(double)h[i]/tan(t);
ans+=(double)h[i]/sin(t)/v[i];
t=pi/2-asin(sin(pi/2-t)*v[i+1]/v[i]);
}
if (sum<=x) return 1;
else return 0;
}
int main()
{
n=read(),x=read();
for(int i=1;i<=n;i++)
h[i]=read();
for(int i=1;i<=n;i++)
v[i]=read();
double l=0,r=pi/2;
while(l+eps<r)
{
double mid=(l+r)/2;
if(cal(mid)) r=mid;
else l=mid;
}
printf("%.3lf\n",ans);
return 0;
}