acdream1221Little Jumper+三分

Problem Description

  Little frog Georgie likes to jump. Recently he have discovered the new playground that seems the perfect place to jump.

  Recently the new jumping exercise has become very popular. Two vertical walls are placed on the playground, each of which has a hole.

  The lower sides of the holes in the walls are on heights b1 and b2 respectively, and upper sides on heights t1 and t2. Walls are parallel and placed on distance l from each other.

  The jumper starts at the distance ds from the first wall. It jumps through the first hole and lands between the walls. After that from that point he jumps through the second hole. The goal is to land exactly at the distance df from the second wall.

Let us describe the jump. The jumper starts from the specified point and starts moving in some chosen direction with the speed not exceeding some maximal speed v, determined by the strength of the jumper. The gravity of g forces him down, thus he moves along the parabolic trajectory.

  The jumper can choose different starting speeds and different directions for his first and second jump.

  Of course, The jumper must not attempt to pass through the wall, although it is allowed to touch it passing through the hole, this does not change the trajectory of the jump. The jumper is not allowed to pass through both holes in a single jump.

  Find out, what must be the maximal starting speed of the jumper so that he could fulfil the excersise.

Input

  Input file contains one or more lines, each of which contains eight real numbers, separated by spaces and/or line feeds. They designate b1, t1, b2, t2, l, ds, df and g. All numbers are in range from 10-2 to 103, t1 ≥ b1 + 10-2, t2 ≥ b2 + 10-2.

  Input file contains at most 1000 test cases.

Output
For each line of the input file output the smallest possible maximal speed the jumper must have to fulfil the exercise. If it is impossible to fulfil it, output -1. Your answer must be accurate up to 10-4.
Sample Input

0.3 1.0 0.5 0.9 1.7 1.2 2.3 9.8
0.6 0.8 0.6 0.8 2.4 0.3 1.5 0.7

Sample Output

5.2883
1.3127

Source
Andrew Stankevich Contest 2

假象得到，在两柱子之间的位置是单峰函数。。so..中间是下边那些函数计算。。

我们知道球的起点x0,落地点x1,我们可以设曲线方程$y=k(x-x_0)(x-x_1)$
首先出射45度是最远的此时的$k=\frac{1}{x_1-x_0}$
其他情况要经过$(x,y)点$的话有$k=\frac{y}{(x-x_0)(x-x_1)}$

然后之后由抛物线的k来确定v
最高点：$h=y(\frac{x_0+x1}{2})=\frac{k(x_0-x_1)(x_0-x_1)}{4}$
由时间等式：$v_y^2=2gh$
水平距离等式：$2v_xv_y=(x_1-x_0)g$
so…………
$v_y=\sqrt{2gh}$
$v_x=\frac{(x1-x0)g}{2v_y}$

#include<bits/stdc++.h>
using namespace std;
#define eps 1e-12

double b1,t1,b2,t2,l,ds,df,g;
//左坐标，右坐标，位置，最低，最高
double mv(double x0,double x1,double wz,double b,double t){
    double jian=x1-x0;
    double y=-1.0/(x1-x0)*(wz-x0)*(wz-x1); //45度飞出去
    double k,vx,vy,minv,h;
    if(b<=y&&y<=t){
        k=1.0/(x1-x0);
        h=k*(x1-x0)*(x1-x0)/4;
        vy=sqrt(2*g*h),vx=jian*g/2.0/vy;
        return sqrt(vy*vy+vx*vx);
    }
    k=-t/((wz-x0)*(wz-x1));//从上边穿过
    h=k*(x1-x0)*(x1-x0)/4;
    vy=sqrt(2*g*h),vx=jian*g/2.0/vy;
    minv=sqrt(vy*vy+vx*vx);

    k=-b/((wz-x0)*(wz-x1));//从下边穿过
    h=k*(x1-x0)*(x1-x0)/4;
    vy=sqrt(2*g*h),vx=jian*g/2.0/vy;
    return min(minv,sqrt(vy*vy+vx*vx));
}
double maxv(double x){
    return max(mv(0,ds+x,ds,b1,t1),mv(ds+x,ds+l+df,ds+l,b2,t2));
}
int main(){
    while(cin>>b1>>t1>>b2>>t2>>l>>ds>>df>>g){
        double L=0,R=l;
        while(fabs(R-L)>eps){
            double m1=(2*L+R)/3.0;
            double m2=(L+2*R)/3.0;
            if(maxv(m1)<maxv(m2)) R=m2;
            else L=m1;
        }
        printf("%.4f\n",maxv((L+R)/2));
    }
    return 0;
}

顺便附上一个其他菊苣写的。。太强了。。

//宽度，位置，最低，最高
double calc(double x,double c,double b,double t)
{
    double y = c - c*c/x;  //
    double p = c*(x-c);
    if(y<b)
        return sqrt(g*p/2/b+g*x*x*b/2/p);
    if(y>t)
        return sqrt(g*p/2/t+g*x*x*t/2/p);
    return sqrt(g*x);
}