Submission #1302717

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302717		ChottuF	Mobile (BOI12_mobile)	C++17	0 / 100	1098 ms	80876 KiB

mobile

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

int main(){
    int n,l;
    cin >> n >> l;
    pair<long double,long double> arr[n];
    for (int i = 0; i<n; i++){
        cin >> arr[i].first >> arr[i].second;
    }
    const long double eps = 1e-4;
    long double lo = 0;
    long double hi = 2e9;
    long double bst = hi;
    while (hi-lo > eps){
        long double mid = (lo+hi)/2;
        vector<pair<long double, long double>> all;
        for (int i = 0; i<n; i++){
            auto [x,y] = arr[i];
            if (y-mid > eps) continue;
            long double num = sqrt((mid*mid) - (y*y));
            long double lft = x - num;
            long double rgt = x + num;
            all.push_back({lft,rgt});
        }
        sort(all.begin(), all.end());
        long double cr = 0LL;
        bool flag = true;
        for (auto u : all){
            auto [a,b] = u;
            if (cr-a > eps){
                cr = max(cr,b);
            }
            else{
                flag = false;
            }
        }
        if (flag && cr-l>eps){
            bst = min(bst, mid);
            hi = mid;
        }
        else{
            lo = mid;
        }
    }
    cout << fixed << setprecision(10) << bst;
    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