제출 #1125146

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1125146		I_FloPPed21	Mobile (BOI12_mobile)	C++20	100 / 100	547 ms	16096 KiB

mobile

#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
const int N=1e6+5;
struct orientare
{
    long long x,y;
}v[N];
int n,k;
void solve()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i].x>>v[i].y;
    }

    long double st=0,dr=1e10;
    while(dr-st>0.00001)
    {
        double mij=(st+dr)/2;
        double curr=0;

        for(int i=1;i<=n;i++)
        {
            double add=sqrt(mij*mij-v[i].y*v[i].y);
            double left=v[i].x-add;
            double right=v[i].x+add;
            if(left<=curr)
                curr=max(curr,right);
        }
        if(curr>=k)
            dr=mij;
        else
            st=mij;
    }
    cout<<fixed<<setprecision(6)<<dr<<'\n';
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

• 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