제출 #1249009

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249009		mirbek01	Mobile (BOI12_mobile)	C++20	0 / 100	732 ms	8248 KiB

mobile

#include <bits/stdc++.h>

using namespace std;

double dist(double x, double y, double a, double b) {
    return sqrt((x - a) * (x - a) + (y - b) * (y - b));
}

signed main() {
    int n, L;
    cin >> n >> L;

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

    auto calc = [&](double a, double b) {
        double res = dist(a, b, x[0], y[0]);
        for (int i = 1; i < n; i++) {
            res = min(res, dist(a, b, x[i], y[i]));
        }
        return res;
    };  

    double l = 0, r = L;
    for (int i = 0; i < 80; i++) {
        double mid1 = (l + l + r) / 3;
        double mid2 = (l + r + r) / 3;
        if (calc(mid1, 0) <= calc(mid2, 0)) {
            l = mid1;
        } else {
            r = mid2;
        }
    }

    cout << fixed << setprecision(6) << calc(l, 0) << endl;
}

• 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