제출 #702611

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702611		nguyennehehe	Mobile (BOI12_mobile)	C++14	0 / 100	1075 ms	40532 KiB

mobile

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

const int INF = 1e9 + 7;

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int n, L; cin >> n >> L;
    vector<pair<int, int>> a(n);
    for (auto &x: a) cin >> x.first >> x.second;

    auto good = [&](double R) {
        vector<pair<double, double>> b;
        for (auto i: a) {
            long long u, v; tie(u, v) = i;
            #define sqr(x) (x) * (x)
            double delta = sqrt(sqr(R) - sqr(v));
            double x1 = -delta + u, x2 = delta + u;
            b.emplace_back(x1, x2);
            // cout << fixed << setprecision(10) << x1 << ' ' << x2 << '\n';
        }
        
        sort(b.begin(), b.end(), [](pair<double, double> x, pair<double, double> y) {
            if (x.second == y.second) return x.first < y.first;
            return x.second < y.second;
        });
        double l = INF, r = -INF;
        for (auto i: b) {
            if (l == INF) {
                l = min(l, i.first);
                r = max(r, i.second);
                continue;
            }
            if (i.second < l || i.first > r) return false;
            l = min(l, i.first), r = max(r, i.second);
        }
        return l <= 0 && r >= L;
    };

    double l = -1, r = 1e9 + 1;
    for (int i = 1, ITER = 80; i <= ITER; ++i) {
        double m = l + (r - l) / 2;
        if (good(m)) r = m;
        else l = m;
    }
    cout << fixed << setprecision(20) << r;
}

• 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