제출 #973162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
973162		jadai007	Mobile (BOI12_mobile)	C++17	0 / 100	694 ms	44024 KiB

mobile

#include<bits/stdc++.h>

using namespace std;

int n;
double L, x[1000100], y[1000100], l = 0, r = 1e9;
vector<pair<double, double>> vc;

bool solve(double mid){
    vc.clear();
    double ans = 0;
    for(int i=1; i<=n; i++) {
        int dis = sqrt(mid*mid - y[i]*y[i]);
        vc.emplace_back(x[i] - dis, x[i] + dis);
    }
    for(auto i: vc) if(i.first <= ans) ans = max(ans, i.second);
    if(ans >= L) return 1;
    else return 0;
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> L;
    for(int i = 1; i<=n; ++i){
        cin >> x[i] >> y[i];
    }
    while(l+0.0001 < r){
        double mid = (l + r) / 2.0;
        if(solve(mid)) r = mid;
        else l = mid + 0.0001;
    }
    cout << fixed << setprecision(6) << l;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 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