제출 #1095199

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1095199		Kodik	Mobile (BOI12_mobile)	C++17	100 / 100	391 ms	35408 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
#define ss second
#define ff first
typedef long long ll;
typedef long double ld;
#define int ll



pair<ll,ll> bases[1000000];


signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, l; 
    cin >> n >> l;
    for(int i = 0; i < n; ++i){
        cin >> bases[i].ff >> bases[i].ss;
    }
    double left = 1, right = 2e9;
    while(right-left>1e-4){
        double mid = left + (right-left)/2;
        double curr = 0;
        for(int i = 0; i < n; ++i){
            double hi_range = sqrt(mid*mid-bases[i].ss*bases[i].ss);
            double start = bases[i].ff-hi_range, end = bases[i].ff+hi_range;
            if(start<=curr) curr = max(curr, end);
        }
        if(curr>=l){
            right = mid;
        }else{
            left = mid;
        }
    }
    cout << fixed << setprecision(3) << right;
    return 0;   
}

• 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: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5