Submission #1010101

# Submission time Handle Problem Language Result Execution time Memory
1010101 2024-06-28T10:28:30 Z Psiuk_Yurii Mobile (BOI12_mobile) C++14
13 / 100
520 ms 48148 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pld;
typedef pair<ll,pll> ppl;

ll n;
ld x[1000009],y[1000009],u,L,R,eps;

bool can(ld R){
   ld r=0.0;
   for(int i=1;i<=n;i++){
       if(R>=y[i]){
           ld x0=x[i]-sqrt(R*R-y[i]*y[i]);
           ld x1=x[i]+sqrt(R*R-y[i]*y[i]);
           if(x0<=r+eps) r=max(x1,r);
           if(r>=u-eps) return true;
       }
   }
  return false;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>u;
    for(int i=1;i<=n;i++) cin>>x[i]>>y[i];
    eps=0.001;
    L=0.0; R=1500000000.0;
    while(L<R-eps){
        ld mid=(L+R)*0.5;
        if(can(mid)) R=mid;
        else L=mid;
    }
    cout<<fixed<<setprecision(5)<<L;


    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Output is correct
2 Incorrect 2 ms 624 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 600 KB Output is correct
2 Incorrect 2 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Incorrect 2 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 37 ms 3448 KB Output is correct
2 Incorrect 28 ms 3928 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 55 ms 3416 KB Output is correct
2 Correct 56 ms 3408 KB Output is correct
3 Correct 84 ms 3924 KB Output is correct
4 Correct 95 ms 4148 KB Output is correct
5 Correct 101 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 39 ms 3748 KB Output is correct
2 Incorrect 31 ms 4188 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 58 ms 5044 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 62 ms 5068 KB Output is correct
2 Incorrect 37 ms 4856 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 280 ms 20404 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 220 ms 24296 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 284 ms 24260 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 242 ms 29008 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 360 ms 28380 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 262 ms 33876 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 380 ms 32336 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 360 ms 38484 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 520 ms 40220 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 457 ms 48148 KB Output isn't correct
2 Halted 0 ms 0 KB -