Submission #1056860

#	Time	Username	Problem	Language	Result	Execution time	Memory
1056860		TimAni	Mobile (BOI12_mobile)	C++17	0 / 100	1088 ms	31736 KiB

mobile

// time-limit: 3000

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const double eps = 1e-4;

struct point {
    double x{}, y{};
};

void solve() {
    int n;
    double L; 
    cin >> n >> L;
    vector<point> p(n);
    for(int i = 0; i < n; i++) {
        cin >> p[i].x >> p[i].y;
    }
    auto intersection = [&](const point& A, double R) -> array<double, 2> {
        // y^2 = 0, 
        // y^2 = R^2 - (x - A.x)^2 + 2yA.y - A.y ^ 2;
        // R^2 - (x - A.x) ^ 2 - A.y^2 = 0
        // R^2 - x^2 + 2xA.x - A.x^2 - A.y^2 = 0
        // x^2 - 2xA.x + A.x^2 + A.y^2 - R^2 = 0
        // D = -4A.y^2 + 4R^2
        if(abs(A.y) > R) {
            return {L, -1};
        }
        double D = R * R - A.y * A.y; // divided by 4
        double x1 = A.x - sqrt(D);
        double x2 = A.x + sqrt(D);
        if(x2 < x1) swap(x1, x2);
        if(x1 < 0) x1 = 0; 
        if(x2 > L) x2 = L;
        return {x1, x2};
    };

    auto good = [&](double R) {
        vector<array<double, 2>> segs(n);
        for(int i = 0; i < n; i++) {
            segs[i] = intersection(p[i], R);
        }
        sort(segs.begin(), segs.end());
        double l = segs[0][0], r = segs[0][1];
        int i = 0;
        while(i + 1 < n && segs[i + 1][0] <= r) {
            r = max(segs[i + 1][1], r);
            i++;
        }
        return r >= L && l <= 0;
    };

    double l = 0, r = 4e9;
    while(r - l > eps) {
        double R = (r + l) / 2;
        if(good(R)) {
            r = R;
        }
        else {
            l = R;
        }
        
    }
    cout << fixed << setprecision(-log10(eps)) << r << endl;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    double T = 1;
    //cin >> T;
    while(T--) solve();
    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