제출 #862451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862451		AndreiVerestiuc	Mobile (BOI12_mobile)	C++11	0 / 100	864 ms	48212 KiB

mobile

#include <bits/stdc++.h>
#define diff 0.00001
#define p pair<double,double>
using namespace std;
bool Check(double d,vector<p> v,int n,int l) {
    double st,dr;
    double distance=sqrt(d*d-v[0].second*v[0].second);
    st=max((double)0,v[0].first-distance);
    dr=min((double)l,v[0].first+distance);

    for (int i=1; i<n; i++) {
        double x=v[i].first,y=v[i].second;
        double distance=sqrt(d*d-y*y);
        if (dr>=max((double)0,x-distance)) dr=min((double)l,x+distance);
        else  return 0;
    }
    return (abs((double)l-dr)<=diff && st<=diff);
}
int main()
{
    int n,l;
    cin>>n>>l;
    vector< p > v(n);
    for (int i=0; i<n; i++)
        cin>>v[i].first>>v[i].second;

    double st=0,dr=100000,mij;
    while (abs(dr-st)>diff) {
        mij=(st+dr)/2;
        //cout<<st<<' '<<dr<<' '<<mij<<'\n';
        if (Check(mij,v,n,l)) dr=mij;
        else  st=mij;
    }
    cout<<fixed<<setprecision(6)<<dr<<'\n';
    return 0;
}

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