Submission #1220896

#TimeUsernameProblemLanguageResultExecution timeMemory
1220896sam230609Mobile (BOI12_mobile)C++20
30 / 100
1096 ms16092 KiB
#include <bits/stdc++.h> #define x first #define y second using namespace std; typedef long long ll; typedef long double ld; pair<ll,ll> p[1000000]; ll n,k; ld l=1,r=1.5e9; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >>n>>k; for(ll i=0;i<n;i++) cin >>p[i].x>>p[i].y; while(r-l>1e-3){ ld mid=(l+r)/2,cur=0; for(ll i=0;i<n;i++){ ld d=sqrt(mid*mid-p[i].y*p[i].y); ld a=p[i].x-d,b=p[i].x+d; if(a<=cur) cur=max(cur,b); }if(cur>=k) r=mid; else l=mid; }cout <<fixed<<setprecision(6)<<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...