제출 #1329914

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1329914		pranvesh	Mobile (BOI12_mobile)	C++20	100 / 100	344 ms	15996 KiB

mobile

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using ll = long long;
#define ret(x) {cout << x << "\n"; return;}
#define pb push_back
#define MOD 998244353
#define mod 1000000007
#define retarr(arr) {for (auto &x : arr) cout << x << " "; cout << "\n"; return;}
#define N 1000005
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define input(arr) for (auto &it: arr) cin >> it;
#define INF (ll)(1e12+5)
typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update> ordered_set;

void solve() {
  ll n, len;
  cin >> n >> len;
  vector<pair<ll,ll>> arr(n);
  for (int i = 0; i<n; i++) {
    cin >> arr[i].F >> arr[i].S;
  }

  auto check = [&](double mid) {
    double cur = 0;
    for (int i = 0; i<n; i++) {
      double delta = sqrt(mid*mid - arr[i].S*arr[i].S);
      double a = arr[i].F-delta, b = arr[i].F+delta;
      if (cur >= a) cur = max(cur, b);
    }
    if (cur >= len) return true;
    return false;
  };

  double l = 1, r = 1e18;
  double ans = r;
  double dif = 1e-3;
  while (r-l > dif) {
    double mid = (l+r)/2.0;
    if (check(mid)) {
      r = mid;
      ans = mid;
    }
    else l = mid;
  }
  cout << fixed << setprecision(4) << ans << "\n";
}

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  int t = 1;
  // cin >> t;
  while(t--) solve();
}

• 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