제출 #1237901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237901		joeydd	Mobile (BOI12_mobile)	C++20	100 / 100	284 ms	15944 KiB

mobile

#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <functional>
#include <future>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <locale>
#include <map>
#include <mutex>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define endl "\n"
using ll = long long;
using ull = unsigned long long;
vector<pair<ll, ll>> p;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  /*freopen("name.in", "r", stdin);
  freopen("name.out", "w", stdout);*/
  int n, trashL;
  cin >> n >> trashL;
  p.resize(n);
  for (auto &pi : p) {
    cin >> pi.first >> pi.second;
  }
  double l = 0, r = 1.5e9;
  while (r - l >= 1e-3) {
    double mid = (double)(l + r) / (double)2;
    double pos = 0;
    for (int i = 0; i < n; i++) {
      double d = sqrt(mid * mid - p[i].second * p[i].second);
      double a = p[i].first - d, b = p[i].first + d;
      if (a <= pos) {
        pos = max(pos, b);
      }
    }
    if (pos >= trashL) {
      r = mid;
    } else {
      l = mid;
    }
  }
  cout << fixed << setprecision(4) << l << endl;
  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