Submission #862460

#	Time	Username	Problem	Language	Result	Execution time	Memory
862460		AndreiVerestiuc	Mobile (BOI12_mobile)	C++11	100 / 100	807 ms	48716 KiB

mobile

#include <bits/stdc++.h>
#define p pair<long long,long long>
using namespace std;
bool Check(double d,vector<p> v,int n,int l) {
    double curr=0;
    for (int i=0; i<n; i++) {
        double x=v[i].first,y=v[i].second;
        double distance=sqrt(d*d-y*y);
        double st=x-distance,dr=x+distance;
        if (st<=curr) curr=max(curr,dr);
    }
    return (curr>=l);
}
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=1.5e9,mij;
    while (dr-st>1e-3) {
        mij=(st+dr)/2;
        //cout<<st<<' '<<dr<<' '<<mij<<'\n';
        if (Check(mij,v,n,l)) dr=mij;
        else  st=mij;
    }
    cout<<fixed<<setprecision(4)<<dr<<'\n';
    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