제출 #979720

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
979720		12345678	Mobile (BOI12_mobile)	C++17	100 / 100	552 ms	35456 KiB

mobile

#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5;

int n, L;
pair<double, double> p[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>L;
    for (int i=1; i<=n; i++) cin>>p[i].first>>p[i].second;
    double l=0, r=2e9;
    while (r-l>1e-4)
    {
        double md=(l+r)/2, mx=0;
        for (int i=1; i<=n; i++)
        {
            double x=md*md-p[i].second*p[i].second;
            if (x<0) continue;
            x=sqrt(x);
            if (p[i].first-x<=mx) mx=max(mx, p[i].first+x);
        }
        if (mx>=L) r=md;
        else l=md;
    }
    cout<<fixed<<setprecision(4)<<l;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5