제출 #1255742

#제출 시각아이디문제언어결과실행 시간메모리
1255742NipphitchMobile (BOI12_mobile)C++20
30 / 100
1097 ms16096 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define double long double const int N=1e6+5; int n,len,x[N],y[N]; signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> len; for(int i=1;i<=n;i++) cin >> x[i] >> y[i]; double l=0.00,r=2.1e9+5.00; while(r-l>1e-4){ double mid=l+(r-l)/2.00; double cur=0.00; for(int i=1;i<=n;i++){ double d=sqrt(mid*mid-y[i]*y[i]); double a=x[i]-d,b=x[i]+d; if(a<=cur) cur=max(cur,b); } if(cur>=len) r=mid; else l=mid; } cout << fixed << setprecision(5) << l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...