Description
Fifa and Fafa are sharing a flat. Fifa loves video games and wants to download a new soccer game. Unfortunately, Fafa heavily uses the internet which consumes the quota. Fifa can access the internet through his Wi-Fi access point. This access point can be accessed within a range of r meters (this range can be chosen by Fifa) from its position. Fifa must put the access point inside the flat which has a circular shape of radius R. Fifa wants to minimize the area that is not covered by the access point inside the flat without letting Fafa or anyone outside the flat to get access to the internet.
The world is represented as an infinite 2D plane. The flat is centered at (x1, y1) and has radius R and Fafa’s laptop is located at (x2, y2), not necessarily inside the flat. Find the position and the radius chosen by Fifa for his access point which minimizes the uncovered area.
Input
The single line of the input contains 5 space-separated integers R, x1, y1, x2, y2 (1 ≤ R ≤ 105, |x1|, |y1|, |x2|, |y2| ≤ 105).
Output
Print three space-separated numbers xap, yap, r where (xap, yap) is the position which Fifa chose for the access point and r is the radius of its range.
Your answer will be considered correct if the radius does not differ from optimal more than 10 − 6 absolutely or relatively, and also the radius you printed can be changed by no more than 10 − 6 (absolutely or relatively) in such a way that all points outside the flat and Fafa’s laptop position are outside circle of the access point range.
Examples
| Input |
|---|
| 5 3 3 1 1 |
| Output |
| 3.7677669529663684 3.7677669529663684 3.914213562373095 |
| Input |
|---|
| 10 5 5 5 15 |
| Output |
| 5.0 5.0 10.0 |
题意:在一个圆形房间中,设置一个最大的圆形WI-FI范围,该范围不能超出房间,也不能覆盖fafa所在的点。
思路:先以房间中心建立相对坐标系,再选取fafa所在的直径长的那部分作为WI-FI的直径。
如图,(x3, y3)利用相似三角形是容易计算的,x3=−x1Rx21+y21√,y3=−y1Rx21+y21√,所以x2=x1+x32,y2=y1+y32,半径为R+Ra2
#include<stdio.h>
#include<math.h>
int main(){
double R,aR,iR,xR,yR,xa,ya,xi,yi,xt,yt;
scanf("%lf %lf %lf %lf %lf",&R,&xR,&yR,&xa,&ya);
xa=xa-xR;
ya=ya-yR;
//相对坐标
aR=sqrt(xa*xa+ya*ya);
//Fafa在外面的情况
if(aR-R>0.0000001){
printf("%.10f %.10f %.10f\n",xR,yR,R);
return 0;
}
//Fafa在中心的情况
if(aR<0.0000001){
printf("%.10f %.10f %.10f\n",xR+0.5*R,yR,R*0.5);
return 0;
}
xt=-1*xa*R/aR;
yt=-1*ya*R/aR;
xi=(xt+xa)/2;
yi=(yt+ya)/2;
iR=(R+aR)/2;
printf("%.10f %.10f %.10f\n",xi+xR,yi+yR,iR);
return 0;
}
本文探讨了一个有趣的问题:如何在一个圆形房间内放置一个圆形WiFi热点,使其覆盖面积最大,同时不超出房间边界且不覆盖特定禁止区域(如Fafa的所在位置)。文章提供了详细的数学解析方法及其实现代码。
857

被折叠的 条评论
为什么被折叠?



