C. New Year and Curling
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
题意: 已知一些圆在 (xi,10100) 处,然后依次落下,下落时只要碰到某个圆,就会停止,求这些圆的最后的y值,也即是水平高度
分析: 首先看了下n的范围很小,可以到
O(n2)
的复杂度,直接暴力枚举,可以画图分析下,见下图
可以看到高度h = y1 + sqrt(2r*2r - (x2-x1)(x2-x1));枚举个最高的高度即可,因为一旦碰到就不会落下了
参考代码
#include<bits/stdc++.h>
using namespace std;
int h[1500];
double res[1500];
int abs(int x,int y) {if(x - y > 0) return x - y;return y - x;}
int main(){
ios_base::sync_with_stdio(0);
int n;
double r;
cin>>n>>r;
for(int i = 0;i < n;i++) {
cin>>h[i];
double rs = r;
for(int j = 0;j < i;j++) {
int dx = abs(h[i],h[j]);
if(dx <= 2*r) {
rs = max(rs,res[j] + sqrt(4*r*r - dx*dx));
}
}
res[i] = rs;
}
for(int i = 0;i < n;i++) printf("%.10f ",res[i]);
return 0;
}
- 如有错误或遗漏,请私聊下UP,ths