제출 #468769

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
468769		DDTerziev04	Mobile (BOI12_mobile)	C++14	0 / 100	958 ms	15964 KiB

mobile

#include<iostream>
#include<cmath>
using namespace std;

const int MAXN=1e6;
const double MAXL=1e10;

pair<long long, long long> pts[MAXN];

bool CanCover(int n, int m, double l)
{
   //cout << l << "\n";
   double d=0;
   for(int i=0; i<n; i++)
   {
      double x=sqrt(l*l-pts[i].second*pts[i].second);
      if(pts[i].first-x<=d)
      {
         d=pts[i].first+x;
      }
   }
   //cout << d << "===========\n";

   return d>=m;
}

int main()
{
   //ios_base::sync_with_stdio(0);
   //cin.tie(0);

   int n, m;
   cin >> n >> m;

   for(int i=0; i<n; i++)
   {
      cin >> pts[i].first >> pts[i].second;
   }

   double diff=0.001, l=0, r=MAXL, ans;
   while(r-l>=diff)
   {
      double mid=l+(r-l)/2;
      if(CanCover(n, m, mid))
      {
         ans=mid;
         r=mid;
      }
      else
      {
         l=mid;
      }
   }

   cout << ans << "\n";

   return 0;
}

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