Space Golf~物理题目

Description

You surely have never heard of this new planet surface exploration scheme, as it is being carried out in a project with utmost secrecy. The scheme is expected to cut costs of conventional rover-type mobile explorers considerably, using projected-type equipment nicknamed "observation bullets".

Bullets do not have any active mobile abilities of their own, which is the main reason of their cost-efficiency. Each of the bullets, after being shot out on a launcher given its initial velocity, makes a parabolic trajectory until it touches down. It bounces on the surface and makes another parabolic trajectory. This will be repeated virtually infinitely.

We want each of the bullets to bounce precisely at the respective spot of interest on the planet surface, adjusting its initial velocity. A variety of sensors in the bullet can gather valuable data at this instant of bounce, and send them to the observation base. Although this may sound like a conventional target shooting practice, there are several issues that make the problem more difficult.

There may be some obstacles between the launcher and the target spot. The obstacles stand upright and are very thin that we can ignore their widths. Once the bullet touches any of the obstacles, we cannot be sure of its trajectory thereafter. So we have to plan launches to avoid these obstacles.
Launching the bullet almost vertically in a speed high enough, we can easily make it hit the target without touching any of the obstacles, but giving a high initial speed is energy-consuming. Energy is extremely precious in space exploration, and the initial speed of the bullet should be minimized. Making the bullet bounce a number of times may make the bullet reach the target with lower initial speed.
The bullet should bounce, however, no more than a given number of times. Although the body of the bullet is made strong enough, some of the sensors inside may not stand repetitive shocks. The allowed numbers of bounces vary on the type of the observation bullets.

You are summoned engineering assistance to this project to author a smart program that tells the minimum required initial speed of the bullet to accomplish the mission.

Figure D.1 gives a sketch of a situation, roughly corresponding to the situation of the Sample Input 4 given below.

Figure D.1. A sample situation

You can assume the following.

The atmosphere of the planet is so thin that atmospheric resistance can be ignored.
The planet is large enough so that its surface can be approximated to be a completely flat plane.
The gravity acceleration can be approximated to be constant up to the highest points a bullet can reach.

These mean that the bullets fly along a perfect parabolic trajectory.

You can also assume the following.

The surface of the planet and the bullets are made so hard that bounces can be approximated as elastic collisions. In other words, loss of kinetic energy on bounces can be ignored. As we can also ignore the atmospheric resistance, the velocity of a bullet immediately after a bounce is equal to the velocity immediately after its launch.
The bullets are made compact enough to ignore their sizes.
The launcher is also built compact enough to ignore its height.

You, a programming genius, may not be an expert in physics. Let us review basics of rigid-body dynamics.

We will describe here the velocity of the bullet v with its horizontal and vertical components vx and vy (positive meaning upward). The initial velocity has the components vix and viy, that is, immediately after the launch of the bullet, vx = vix and vy = viy hold. We denote the horizontal distance of the bullet from the launcher as x and its altitude as y at time t.

The horizontal velocity component of the bullet is kept constant during its flight when atmospheric resistance is ignored. Thus the horizontal distance from the launcher is proportional to the time elapsed.

x=vixt(1)(1)x=vixt
The vertical velocity component vy is gradually decelerated by the gravity. With the gravity acceleration of g, the following differential equation holds during the flight.

dvydt=−g(2)(2)dvydt=−g

Solving this with the initial conditions of vy = viy and y = 0 when t = 0, we obtain the following.

y==−12gt2+viyt−(12gt−viy)t(3)(4)(3)y=−12gt2+viyt(4)=−(12gt−viy)t

The equation (4) tells that the bullet reaches the ground again when t = 2viy/g. Thus, the distance of the point of the bounce from the launcher is 2vixviy/g. In other words, to make the bullet fly the distance of l, the two components of the initial velocity should satisfy 2vixviy = lg.
Eliminating the parameter t from the simultaneous equations above, we obtain the following equation that escribes the parabolic trajectory of the bullet.

y=−(g2v2ix)x2+(viyvix)x(5)(5)y=−(g2vix2)x2+(viyvix)x

For ease of computation, a special unit system is used in this project, according to which the gravity acceleration g of the planet is exactly 1.0.

Input

The input consists of several tests case with the following format.

d n bp1 h1p2 h2⋮pn hnd n bp1 h1p2 h2⋮pn hn

For each test, the first line contains three integers, d, n, and b. Here, d is the distance from the launcher to the target spot (1 ≤ d ≤ 10000), n is the number of obstacles (1 ≤ n ≤ 10), and b is the maximum number of bounces allowed, not including the bounce at the target spot (0 ≤ b ≤ 15).

Each of the following n lines has two integers. In the k-th line, pk is the position of the k-th obstacle, its distance from the launcher, and hk is its height from the ground level. You can assume that 0 < p1, pk < pk + 1 for k = 1, …, n − 1, and pn < d. You can also assume that 1 ≤ hk ≤ 10000 for k = 1, …, n.

Output

Output the smallest possible initial speed vi that makes the bullet reach the target. The initial speed vi of the bullet is defined as follows.

vi=v2ix+v2iy−−−−−−−√vi=vix2+viy2

The output should not contain an error greater than 0.0001.

Sample Input

Sample Output

14.57738

3.16228

7.78175

11.08710

这题一开始二分写的，但是第二组样例一直过不去，后面深入思考，
速度其实是有一个表达式的，hmax有一个最小值，二分没有想到这点，
需要特判一下

不会电脑画图，就这样吧，一些重要的公式推导写出来了。

 #include <cstdio>

 #include <algorithm>

 #include <vector>

 #include <queue>

 #include <cstring>

 #include <string>

 #include <cmath>

 #include <map>

 using namespace std;

 const int maxn = 2e5 + ;

 const int INF = 0x7fffffff;

 double x[], h[], x1[], h1[];

 double d, len, ans, hmax;

 int n, b;

 int main() {

     while(scanf("%lf%d%d", &d, &n, &b) != EOF) {

         ans = 1.0 * INF;

         for (int i =  ; i < n ; i++) {

             scanf("%lf%lf", &x[i], &h[i]);

         }

         int flag = ;

         for (int i =  ; i <= b +  ; i++) {

             len = 1.0 * d / (1.0 * i);

             flag = ;

             hmax = -;

             for (int j =  ; j < n ; j++) {

                 x1[j] = x[j];

                 while(x1[j] - len >= ) {

                     x1[j] -= len;

                 }

                 h1[j] = h[j];

                 if (fabs(x[j]) <= 1e-) {

                     flag = ;

                     break;

                 }

                 double temph = len * len * h1[j] / (len - x1[j]) / x1[j] / 4.0;

                 hmax = max(hmax, temph);

             }

             if (flag == )   continue;

             if (hmax < len /  ) ans = min(ans, len);

             else ans = min(len * len /  / hmax +  * hmax, ans);

         }

         printf("%.5f\n", sqrt(ans));

     }

     return ;

 }