제출 #1010110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1010110		Psiuk_Yurii	Mobile (BOI12_mobile)	C++17	75 / 100	1072 ms	31824 KiB

mobile

#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.0001;
    L=0.0; R=1000000000.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;
}

• 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: 5 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5