# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670283 | RadicaI | Mobile (BOI12_mobile) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
cout.precision(7);
int n,siz; cin >> n>>siz;
pair<ll, ll> stations[n];
for(int i=0; i<n; i++) cin >> stations[i].first >> stations[i].second;
e9;
while(r - l > 1e-3){
double m = (l+r)/2.0;
double store=0;
for(int i=0; i<n; i++){
double ph = stations[i].first + sqrt(m*m-stations[i].second*stations[i].second);
double pl = stations[i].first - sqrt(m*m-stations[i].second*stations[i].second);
if(pl<=store) store = max(store, ph);
}
if(store>=siz) r=m;
else l=m;
}
cout << l;
}