제출 #1167895

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1167895		julia_08	Mobile (BOI12_mobile)	C++20	100 / 100	488 ms	16096 KiB

mobile

#include <bits/stdc++.h>
using namespace std;

using ld = long double;
using ll = long long;

const int MAXN = 1e6 + 10;

ll x[MAXN], y[MAXN];

int n; ll L;

bool check(ld d){

  ld max_x = 0;

  for(int i=1; i<=n; i++){

    ld delta = (ld) (d * d - y[i] * y[i]);

    if(delta < 1e-9) continue;

    ld l = (ld) (x[i] - sqrt(delta)), r = (ld) (x[i] + sqrt(delta));

    if(l <= max_x) max_x = max(max_x, r);

  }

  return max_x < L;
}

ld bs(){

  ld l = 0, r = 1e10;

  for(int i=0; i<75; i++){
    ld m = (l + r) / 2;
    if(check(m)) l = m;
    else r = m;
  }

  return l;
}

int main(){
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> L;

  for(int i=1; i<=n; i++){
    cin >> x[i] >> y[i];
  }

  cout << fixed << setprecision(6) << bs() << "\n";

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