Submission #1124017

#	Time	Username	Problem	Language	Result	Execution time	Memory
1124017		lsdwpqer	Mobile (BOI12_mobile)	C++20	4 / 100	989 ms	24264 KiB

mobile

#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long

int main(){
ll n,le;
cin >> n >> le;
double x[n];
double y[n];
for(int i = 0;i < n;i++){
    cin >> x[i] >> y[i];
}
double ra = 0;
double rb = 1e12;
while(rb-ra > 0.0001){
    double r = (rb-ra)/2+ra;
   // r = 5.99;
   //    cout << ra << " " <<rb << " r " << r;
    stack<double> s;
    s.push(0);
    double p = 0;
    for(int i = 0;i <  n;i++){
     //   cout << x[i] - sqrt(r*r-y[i]*y[i]) << " sinistra e destra " << x[i] + sqrt(r*r-y[i]*y[i]) << endl;
        while(!s.empty()){
            double a = s.top();

            if(r-y[i] > 0 && (x[i]-sqrt(r*r-y[i]*y[i])) <= a && x[i]+(sqrt(r*r-y[i]*y[i])) > a){
                p = x[i]+sqrt(r*r-y[i]*y[i]);
                break;
            }
            s.pop();
        }
    s.push(p);
    }

    if(p >= le){
        rb = r;
    }
    else{
        ra = r;
    }
   // break;
}
cout << ra << endl;

}

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