제출 #647136

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
647136		ArifBillah	Mobile (BOI12_mobile)	C++14	100 / 100	721 ms	35328 KiB

mobile

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

#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pii>
#define vpll vector<pll>
#define vvi vector<vi>
#define ff first
#define ss second
#define endl "\n"
#define pb(x) push_back(x)
#define pp() pop_back()
#define inf LONG_MAX
#define dvg(x) cout<<#x<<" "<<x<<endl;
#define dvg2(x, y) cout<<#x<<" "<<x<<" "<<#y<<" "<<y<<endl;
#define dvgv(x) cout<<#x<<" { "; for(auto i : x) {cout<<i<<" ";} cout<<"}"<<endl;
#define dvgp(x) cout<<#x" {"<<x.ff<<", "<<x.ss<<"}"<<endl;
int dx[] {-1, 0, 1, 0, 1, 1, -1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

int const N = 1e5 + 10;
double const eps = 1e-3;

int main()
{
  fastio();
   
  int n;
  ll l;
  cin>>n>>l;

  vector<pll> v(n);
  for(int i = 0; i < n; i++)
    cin>>v[i].ff>>v[i].ss;

  double lo = 0, hi = 1.5e9;

  for(int it = 0; it < 65; it++){
    double mid = (hi + lo)/2;

    double cur = 0;
    for(int i = 0; i < n; i++){
      double p = sqrt(mid*mid - v[i].ss*v[i].ss);
      double a = v[i].ff - p, b = v[i].ff + p;
      if(a <= cur) cur = max(cur, b);
    }
    if(cur >= l)
      hi = mid;
    else
      lo = mid;
  }
  cout<<setprecision(12)<<fixed<<lo<<endl;
}

• 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