제출 #1287658

#제출 시각아이디문제언어결과실행 시간메모리
1287658xyxwongMobile (BOI12_mobile)C++20
8 / 100
1097 ms31724 KiB
#include<iostream> #include<vector> #include<algorithm> #include<cmath> using namespace std; #define ll long long #define ld long double #define fi first #define se second #define flt float #define pld pair<ld,ld> int main(){ ll n,l;cin>>n>>l; vector<pld>v(n); for(auto&p:v)cin>>p.fi>>p.se; ll lo = 0,hi = 1e18; while(lo<hi){ ll mid = (lo+hi)/2; ld r = mid; r/=1e4; ld a = 0,b=0; for(int i = 0;i<n;i++){ auto&p = v[i]; ld bx = p.fi - sqrtl(r*r-p.se*p.se),ex = p.fi + sqrtl(r*r-p.se*p.se); b = max(b,ex); if(bx<=a)a = b; } if(a>=l){ hi = mid; }else{ lo = mid+1; } } ld ans = lo; cout<<ans/1e4; }
#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...