제출 #1255733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1255733		Nipphitch	Mobile (BOI12_mobile)	C++20	0 / 100	347 ms	15944 KiB

mobile

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

const double EPS = 1e-9;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    double L;
    cin >> N >> L;

    vector<double> x(N), y(N);
    for (int i = 0; i < N; i++) {
        cin >> x[i] >> y[i];
    }

    double lo = 0, hi = 0;
    // hi bound: farthest possible distance to the farthest station
    for (int i = 0; i < N; i++) {
        hi = max(hi, hypot(max(x[i], L) - min(x[i], 0.0), y[i]));
    }

    for (int it = 0; it < 70; it++) { // enough for double precision
        double mid = (lo + hi) / 2.0;

        double mxlo = 0.0, mnhi = L;
        bool ok = true;
        for (int i = 0; i < N; i++) {
            if (fabs(y[i]) > mid + EPS) { ok = false; break; }
            double dx = sqrt(max(0.0, mid * mid - y[i] * y[i]));
            mxlo = max(mxlo, x[i] - dx);
            mnhi = min(mnhi, x[i] + dx);
        }
        if (ok && mnhi + EPS >= mxlo && mnhi >= 0 - EPS && mxlo <= L + EPS) {
            hi = mid;
        } else {
            lo = mid;
        }
    }

    cout << fixed << setprecision(6) << hi << "\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