제출 #1162052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1162052		jared	Mobile (BOI12_mobile)	C++20	25 / 100	1096 ms	16096 KiB

mobile

#include "bits/stdc++.h"
#define int long long
#define double long double
using namespace std;

int n, L;
vector<pair<int, int> > p;

bool ok(double radius) {
    double end = 0;
    for (auto [x, y]: p) {
        // Equation of a circle: (X - x)^2 + (Y - y)^2 = r^2
        // Want to find intersect with Y = 0,
        // (X - x)^2 = r^2 - y^2
        //         X = (+-) sqrt(r^2 - y^2) + x
        double delta = sqrt(radius * radius - y * y);
        double l_intercept = -delta + x, r_intercept = delta + x;
        if (l_intercept <= end) end = max(end, r_intercept);
    }
    return end >= L;
}

signed main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    cin >> n >> L;
    p.resize(n);
    for (auto &i: p)
        cin >> i.first >> i.second;

    double l = 0, r = INT_MAX;
    while (r - l >= 1e-8) {
        double mid = l + (r - l) / 2;

        if (ok(mid)) r = mid;
        else l = mid;
    }
    cout << fixed << setprecision(6) << l << 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: 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