제출 #551989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
551989		narcissus	Mobile (BOI12_mobile)	C++17	100 / 100	973 ms	35248 KiB

mobile

#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>

using namespace std;

int main()
{
    int n, l;
    cin >> n >> l;
    pair<long long, long long> coords[n];
    for (int i = 0; i < n; i++) {
        cin >> coords[i].first >> coords[i].second;
    }

    double low = 1, high = 2e9;
    while (high - low > 1e-3) {
        double mid = low + (high - low) / 2;
        // cout << mid << ":" << endl;
        double maxv = 0;
        for (int i = 0; i < n; i++) {
            long long x = coords[i].first;
            long long y = coords[i].second;
            double xdist = sqrt(pow(mid, 2) - pow(y, 2));
            double a1 = x - xdist;
            double a2 = x + xdist;
            // cout << "a " << a1 << ' ' << a2 << endl;
            if (a1 <= maxv)
                maxv = max(maxv, a2);
        }
        if (maxv >= l) {
            high = mid;
        } else {
            low = mid;
        }
    }
    cout << fixed << setprecision(4) << low << endl;

    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