제출 #1136524

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1136524		concua	Mobile (BOI12_mobile)	C++20	0 / 100	634 ms	16068 KiB

mobile

#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 1;
pair<double, double> p[N];

int n, L;

double pre = 0.0;

bool check(double x) {
    pre = 0.0; 
    for (int i = 1; i <= n; i++){
        if (x * x < p[i].second * p[i].second){
            return false; 
        }
        
        double delta = sqrt(x * x - p[i].second * p[i].second);

        if (pre > p[i].first - delta){
            
            pre = max(pre, p[i].first + delta);
        } 
        else{
            
            pre = p[i].first - delta;
        }
    }

    return pre >= L;
}

int main() {
    cin >> n >> L;
    for (int i = 1; i <= n; i++) {
        cin >> p[i].first >> p[i].second;
    }

    double l = 0, r = 1e9 + 1;

    while (r - l > 1e-4){
        double mid = (r + l) / 2;

        if (check(mid)){
            
            r = mid;
            
        } 
        else{
            
            l = mid;
            
        }
    }

    cout << fixed << setprecision(4) << r << "\n";

    return 0;
}

• 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