[2014Contest_1B]Big Keng

解题思路:第一感觉是三分,然后确实写了一个,由于输入范围没给三分的边界不好确定,反正我弄个了好多个都TLE了。

其实题目也再暗示,不给输入范围和精确的样例输出。

很明显物体放大后最优的比例是不变的,我一开始SB没想到。


#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <stack>
#include <cstdlib>
#include <ctime>
using namespace std;

#pragma comment(linker,"/STACK:102400000,102400000")

#define LL long long
#define ULL unsigned long long
#define Hei cout << "Czy!!!" << endl;
#define lson rt << 1, l, mid
#define rson  rt << 1 | 1, mid + 1, r
#define MOD 1000000007

/*
clock_t t1, t2;
t1 = clock();
t2 = clock();
cout << (double)(t2 - t1) / CLOCKS_PER_SEC << endl;
*/

/*

#define inf 1e10

double v, l1, r1, l2, r2;

int dcmp(double x)
{
    if (fabs(x) < 1e-12) return 0;
    if (x < 0) return -1;
    else return 1;
}

double val2(double h, double R)
{
    double l = 0, r = R;
    double ret;
    while (dcmp(l - r) < 0)
    {
        //cout << h << " " << R << endl;
        double mid = (l + r) / 2;
        double midmid =(mid + r) / 2;
        double h1 = 3 * (v - (acos(-1.0) * h * R * R)) / acos(-1.0) / (R * R + mid * mid + R * mid);
        double h2 = 3 * (v - (acos(-1.0) * h * R * R)) / acos(-1.0) / (R * R + midmid * midmid + R * midmid);
        double s1 = acos(-1.0) * (R + mid) * sqrt(h1 * h1 + (R - mid) * (R - mid)) + acos(-1.0) * mid * mid;
        double s2 = acos(-1.0) * (R + midmid) * sqrt(h2 * h2 + (R - midmid) * (R - midmid)) + acos(-1.0) * midmid * midmid;
        if (s1 > s2) l = mid, ret = s2;
        else r = midmid, ret = s1;
        l2 = l, r2 = r;
    }
    //cout << ret + 2 * acos(-1.0) * R * h + acos(-1.0) * R * R << endl;
    return ret + 2 * acos(-1.0) * R * h;
}

double val(double h)
{
    double l = 0, r = inf, ret;
    while (dcmp(l - r) < 0)
    {
       // cout << l << " " << r << endl;
        double mid = (l + r) / 2;
        double midmid = (mid + r) / 2;
        if (dcmp(h * acos(-1.0) * midmid * midmid - v) >= 0)
        {
            r = midmid;
            continue;
        }
        if (dcmp(h * acos(-1.0) * mid * mid - v) >= 0)
        {
            r = mid;
            continue;
        }
        double x = val2(h, mid);
        double y = val2(h, midmid);
        if (x > y) l = mid, ret = y;
        else r = midmid, ret = x;
        l1 = l, r1 = r;
    }
    return ret;
}

int main()
{
    while (cin >> v)
    {
        double l = 0, r = inf, ret;
        while (dcmp(l - r) < 0)
        {
            //cout << l << " " << r << endl;
            double mid = (l + r) / 2;
            double midmid = (mid + r) / 2;
            double x = val(mid);
            double y = val(midmid);
            if (x > y) l = mid, ret = y;
            else r = midmid, ret = x;
        }
        printf("%.9lf", ret);
    }
}*/


int main()
{
    double v;
    while (cin >> v)
    {
        double p = pow(v * 1.0, 1.0 / 3);
        printf("%.6f\n", p * p * 3.939773108);

    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值