ACM--steps--4.1.7--Dome of Circus(三分）

最新推荐文章于 2023-10-23 21:25:36 发布

木土的H

最新推荐文章于 2023-10-23 21:25:36 发布

阅读量351

点赞数

分类专栏：基础三分查找文章标签：基础题数字三分查找

本文链接：https://blog.csdn.net/wyx13109395842/article/details/44036953

版权

基础同时被 2 个专栏收录

141 篇文章 0 订阅

订阅专栏

三分查找

3 篇文章 0 订阅

订阅专栏

Dome of Circus

Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 471 Accepted Submission(s): 222

Problem Description

A travelling circus faces a tough challenge in designing the dome for its performances. The circus has a number of shows that happen above the stage in the air under the dome. Various rigs, supports, and anchors must be installed over the stage, but under the dome. The dome itself must rise above the center of the stage and has a conical shape. The space under the dome must be air-conditioned, so the goal is to design the dome that contains minimal volume.
You are given a set of n points in the space; (xi, yi, zi) for 1 ≤ i ≤ n are the coordinates of the points in the air above the stage that must be covered by the dome. The ground is denoted by the plane z = 0, with positive z coordinates going up. The center of the stage is on the ground at the point (0, 0, 0).
The tip of the dome must be located at some point with coordinates (0, 0, h) with h > 0. The dome must have a conical shape that touches the ground at the circle with the center in the point (0, 0, 0) and with the radius of r. The dome must contain or touch all the n given points. The dome must have the minimal volume, given the above constraints.

Input

The input begins with an integer T. The next T blocks each represents a case. The first line of each case contains a single integer number n (1 ≤ n ≤ 10 000) - the number of points under the dome. The following n lines describe points with three floating point numbers xi, yi, and zi per line - the coordinates of i-th point. All coordinates do not exceed 1000 by their absolute value and have at most 2 digits after decimal point. All zi are positive. There is at least one point with non-zero xi or yi.

Output

For each case , write to the output file a single line with two floating point numbers h and r - the height and the base radius of the dome. The numbers must be precise up to 3 digits after decimal point.

Sample Input

3
1
1.00 0.00 1.00
2
1.00 0.00 1.00
0.00 1.50 0.50
3
1.00 0.00 1.00
0.00 1.50 0.50
-0.50 -0.50 1.00

Sample Output

3.000 1.500
2.000 2.000
2.000 2.000

Author

Georgiy Korneev

Source

2010 Northeastern European Regional Contest

Recommend

notonlysuccess

//用c++提交

#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
double wyx[10009],dyx[10009];//wyx表示x轴的坐标，dyx表示z轴的坐标。
int n;
double fun(double h)
{
    double r=0;
    for(int i=1;i<=n;i++)
    {
        //根据相似三角形推得。
        //高越大，半径越小，反之一样。
        if((h*wyx[i])/(h-dyx[i])>r)
        r=(h*wyx[i])/(h-dyx[i]);
    }
    return r;
}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        cin>>n;
        double t,mid,mmid;//y轴的坐标。
        double left,right,r1,r2;
        left=0;
        right=9999999;
        for(int i=1;i<=n;i++)
        {
            cin>>wyx[i]>>t>>dyx[i];
            wyx[i]=sqrt(wyx[i]*wyx[i]+t*t);
            if(dyx[i]>left)
            left=dyx[i];
        }
        while(fabs(left-right)>0.0000001)
        {
            mid=left+(right-left)/3;
            mmid=right-(right-left)/3;
            r1=fun(mid);
            r2=fun(mmid);
            if(r1*r1*mid>r2*r2*mmid)
            left=mid;
            else
            right=mmid;
        }
         cout<<fixed<<setprecision(3)<<left<<" ";
         cout<<fixed<<setprecision(3)<<fun(left)<<endl;
    }
    return 0;
}