# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167842 | InvMOD | Mobile (BOI12_mobile) | C++20 | 499 ms | 31560 KiB |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
using ld = long double;
void solve()
{
int n,L; cin >> n >> L;
vector<pair<ld, ld>> a(n);
for(int i = 0; i < n; i++){
cin >> a[i].fi >> a[i].se;
a[i].fi = abs(a[i].fi), a[i].se = abs(a[i].se);
}
auto square = [&](ld x) -> ld{
return x * x;
};
// (x - point) ^ 2 + y ^ 2 >= dist ^ 2
// (new point - x) ^ 2 - y ^ 2 >= dist ^ 2
// -> new point = sqrt(dist ^ 2 + y ^ 2) + x
auto good = [&](ld dist) -> bool{
ld point = 0;
for(int i = 0; i < n; i++){
if(square(a[i].fi - point) + square(a[i].se) >= square(dist)){
return true;
}
else{
point = sqrt(square(dist) + square(a[i].se)) + a[i].fi;
}
}
return point <= 1.0l * L;
};
sort(all(a));
ld l = 0, r = L + 1;
for(int time = 0; time < 64; time++){
ld mid = (l + r) / 2.0l;
if(good(mid)){
l = mid;
}
else r = mid;
}
cout << fixed << setprecision(6) << l << "\n";
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define name "InvMOD"
if(fopen(name".INP", "r")){
freopen(name".INP", "r", stdin);
freopen(name".OUT", "w", stdout);
}
solve();
return 0;
}
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... |