# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670276 | RadicaI | Mobile (BOI12_mobile) | C++17 | 1097 ms | 131072 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 ld = long double;
int main(){
cout.precision(10);
int n,siz; cin >> n>>siz;
pair<ld, ld> stations[n];
for(int i=0; i<n; i++) cin >> stations[i].first >> stations[i].second;
ld l = 1e-5; ld r = 3e9;
int random=0;
ld ans=0;
while(l<=r && random<=2){
ld m = (l+r)/2.0;
ld lowest=0.0; ld highest=l+0.0;
set<pair<ld, int> > endp;
for(int i=0; i<n; i++){
if(abs(stations[i].second) <=m){
ld ph = stations[i].first + sqrt(m*m-stations[i].second*stations[i].second);
ld pl = stations[i].first - sqrt(m*m-stations[i].second*stations[i].second);
endp.insert(make_pair(pl,0));
endp.insert(make_pair(ph,1));
}
}
bool check=true;
int count=0;
for(auto thing: endp){
if(thing.second == 0) count++;
else count--;
if(thing.first <siz && count==0) check=false;
}
if(check){
ans=m; if(r==m) random++; r=m;
}else{
if(l==m) random++; l=m;
}
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |