제출 #669101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
669101		hanlei35	Mobile (BOI12_mobile)	C++17	100 / 100	462 ms	35228 KiB

mobile

#include <iostream>
#include <cmath>
#include <iomanip>
using ll = long long;
using namespace std;

int N, L; 
pair<ll,ll> xy[1000005];
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> N >> L;
  for(int i=0;i<N;i++){
    cin >> xy[i].first >> xy[i].second;
  }
  double l = 1, r = 1.5E9;
  while(r - l > 1E-4){
    double mid = (l+r)/2, curr = 0;
    for(int i=0;i<N;i++){
      double delta = sqrt(mid*mid - xy[i].second * xy[i].second);
      double a = xy[i].first - delta, b = xy[i].first + delta;
      if(a<=curr) curr = max(curr,b);
    }
    if(curr >= L) r = mid;
    else l = mid;
  }
  cout << fixed << setprecision(4) << l << "\n";
}

• 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