# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520825 | jpark | Mobile (BOI12_mobile) | C++14 | 1085 ms | 41204 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<iostream>
#include<algorithm>
#include<vector>
#include<math.h>
#define pii pair<int,int>
#define f first
#define s second
using namespace std;
int main(){
int n,le; cin >> n >> le;
vector<pii> t;
int a,b;
for(int x=0; x<n; ++x){
cin >> a >> b;
t.push_back({a,b});
}
double l = 0;
double r = 1e10;
double mid;
while(r-l>1e-5){
vector<pair<double,double>> range;
mid = l+(r-l)/2;
for(int x=0; x<n; ++x){
if(mid<t[x].s){
continue;
}
double mi = t[x].f-sqrt(mid*mid-t[x].s*t[x].s);
double ma = t[x].f+sqrt(mid*mid-t[x].s*t[x].s);
range.push_back({mi,ma});
}
sort(range.begin(),range.end());
double maxc = 0;
bool p = true;
for(int x=0; x<range.size(); ++x){
if(range[x].s<0){
continue;
}
if(range[x].f>maxc){
p = false;
break;
}
maxc = max(maxc,range[x].s);
}
if(p&&maxc>=le){
r = mid;
}
else{
l = mid;
}
}
cout << l;
}
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... |