제출 #920755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
920755		ethanv13	Mobile (BOI12_mobile)	C++17	70 / 100	1101 ms	28244 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
int main() {
    long long n,l;cin>>n>>l;
    vector<pair<long long,long long>>a(n);
    for(int i=0;i<n;++i){
        cin>>a[i].first>>a[i].second;
    }
    long double lo=0;
    long double hi=4e9;
    long double delta=1e-5;
    while(hi-lo>delta){
        long double mid=(lo+hi)/2;
        long double curr=0;
        for(int i=0;i<n;++i){
            long double dist=sqrt(mid*mid-a[i].second*a[i].second);
            if(a[i].first-dist<=curr){curr=max(a[i].first+dist,curr);}
        }
        if(curr>=l){hi=mid;}else{lo=mid;}
    }
    cout<<fixed<<setprecision(5);
    cout<<lo<<endl;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5