提出 #36826220

---

ソースコード 拡げる

// c++テンプレ
// https://atcoder.github.io/ac-library/document_ja/index.html
// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
#define repp(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define perp(i, r, l) for (int i = (int)(r); i > (int)(l); i--)
#define rep(i, r) for (int i = 0; (int)(i) < (int)(r); i++)
#define per(i, r) for (int i = (int)(r); (int)(i) > 0; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
    ll A, B;
    cin >> A >> B;
    double left = 0, right = (A / B) + 2;
    double C1, C2;
    double ans1, ans2, ans3, ans4;
    while ((right - left) > 1)
    {
        C1 = (left + ((right - left) / 3.0));
        C2 = right - ((right - left) / 3.0);
        ans1 = (A / sqrtl(C1 + 1)) + (B * C1);
        ans2 = (A / sqrtl(C2 + 1)) + (B * C2);
        ans3 = (A / sqrtl(left + 1)) + (B * left);
        ans4 = (A / sqrtl(right + 1)) + (B * right);
        if (ans1 <= ans2 && ans2 <= ans4)
        {
            right = C2;
        }
        else if (ans3 >= ans1 && ans1 >= ans2)
        {
            left = C1;
        }
        else
        {
            left = C1;
            right = C2;
        }
    }
    ans1 = (A / sqrtl((ll)left + 1)) + (B * (ll)left);
    ans2 = (A / sqrtl((ll)left + 2)) + (B * ((ll)left + 1));
    ans3 = (A / sqrtl((ll)right + 1)) + (B * (ll)right);
    ans4 = (A / sqrtl((ll)right + 2)) + (B * ((ll)right + 1));
    printf("%.10lf\n", min(min(ans1, ans2), min(ans3, ans4)));
    return 0;
}

提出情報

ジャッジ結果