Submission #841627

#	Time	Username	Problem	Language	Result	Execution time	Memory
841627		a5a7	Mobile (BOI12_mobile)	C++14	8 / 100	1095 ms	62988 KiB

mobile

#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define READ(arr, n) for (int i = 0; i < (n); i++) cin >> arr[i];
#define ABS(a) (max((a), -(a)))
#define MOD 1000000007
using namespace std;
typedef long long ll;
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n; long double l;
    cin >> n >> l;
    long double x[n];
    long double y[n];
    long double right = 0;
    for (int i = 0; i < n; i++) cin >> x[i] >> y[i], right = max(right, sqrtl(x[i]* x[i] + y[i]*y[i])), right = max(right, sqrtl((x[i]-l)*( x[i]-l) + y[i]*y[i]));
    long double left = 0;
    while ((right-left) > (0.0005)){
        long double mid = (left+right)/2;
        pair<long double, long double> ranges[n];
        for (int i = 0; i < n; i++){
            long double sqr = sqrtl(max(mid*mid-y[i]*y[i], (long double) 0));
            ranges[i].first = x[i]-sqr;
            ranges[i].second = x[i]+sqr;
        }
        sort(ranges, ranges+n);
        long double bound = 0;
        for (int i = 0; i < n; i++){
            if (ranges[i].first <= bound){
                bound = max(bound, ranges[i].second);
            }
        }
        if (bound >= l){
            right = mid;
        }else{
            left = mid;
        }
    }
    cout << left << endl;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 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