Submission #639191

#	Time	Username	Problem	Language	Result	Execution time	Memory
639191		Pietra	Mobile (BOI12_mobile)	C++14	70 / 100	1093 ms	16012 KiB

mobile

#include<bits/stdc++.h>
#define int long long
using namespace std ;
 
const int maxn = 1e6 + 5 ;
const double inf = 2e9 ;
 
double n ;
double l, x[maxn], y[maxn] ;
 
bool check(double r){
 
    double f = 0 ;
 
    for(int i = 1 ; i <= n ; i++){
        if(r < y[i]) continue ;
        double dx = sqrt((r*r) - (y[i]*y[i])) ;
        double ini = x[i] - dx, fim = x[i] + dx ;
        if(ini <= f) f = max(f, fim) ;
    }
 
    return (f >= l) ;
 
}
 
int32_t main(){
 
    cin >> n >> l ; 
 
    for(int i = 1 ; i <= n ; i++) cin >> x[i] >> y[i] ;
 
    double ini = 0, fim = inf, mid ;
    int it = 45 ;
 
    while(it--){
        mid = (ini + fim)/2 ;
       // printf("%.3lf\n", mid) ;
        if(check(mid)) fim = mid ;
        else ini = mid ;
    }
 
    cout << fixed << setprecision(5) << fim << "\n" ;
    //printf("%.3lf\n", best) ;
 
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 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