codeforces 908C New Year and Curling

codeforces 908C New Year and Curling

​​ Carol is currently curling.

She has n disks each with radius r on the 2D plane.

Initially she has all these disks above the line y = 10100.

She then will slide the disks towards the line y = 0 one by one in order from 1 to n.

When she slides the i-th disk, she will place its center at the point (xi, 10100). She will then push it so the disk’s y coordinate continuously decreases, and x coordinate stays constant. The disk stops once it touches the line y = 0 or it touches any previous disk. Note that once a disk stops moving, it will not move again, even if hit by another disk.

Compute the y-coordinates of centers of all the disks after all disks have been pushed. Input

The first line will contain two integers n and r (1 ≤ n, r ≤ 1 000), the number of disks, and the radius of the disks, respectively.

The next line will contain n integers x1, x2, …, xn (1 ≤ xi ≤ 1 000) — the x-coordinates of the disks. Output

Print a single line with n numbers. The i-th number denotes the y-coordinate of the center of the i-th disk. The output will be accepted if it has absolute or relative error at most 10 - 6.

Namely, let’s assume that your answer for a particular value of a coordinate is a and the answer of the jury is b. The checker program will consider your answer correct if for all coordinates. Example Input

6 2 5 5 6 8 3 12

Output

2 6.0 9.87298334621 13.3370849613 12.5187346573 13.3370849613

Note

The final positions of the disks will look as follows:

In particular, note the position of the last disk.

题目要求 我从很远的地方向y=0这条直线发射圆球 如果这个圆碰到了y=0那么他停止了运动 如果这个球碰到了其他之前的球 那么好 他还是停止了运动 现在给出每个球初始的横坐标 然后再给个顺序要求输出每个球的纵坐标 那么我每一个球我都可以暴力和前面的所有球算一下如果相交的话 纵坐标是多少 然后取个最大值即可

#include#include#include#define N 1100using namespace std;double x[N],y[N],x1[N];int n,r;int main(){// freopen("cfc.in","r",stdin); scanf("%d%d",&n,&r);x[0]=0;y[0]=0; for (int i=1;i<=n;++i) scanf("%lf",&x1[i]); for (int i=1;i<=n;++i){ double max1=0; for (int j=1;j

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。