제출 #1233865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1233865		joeydd	Mobile (BOI12_mobile)	C++20	45 / 100	1097 ms	31732 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 double;
using ull = unsigned long long;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  /*freopen("name.in", "r", stdin);
  freopen("name.out", "w", stdout);*/
  ll n, f;
  cin >> n >> f;
  vector<ll> x((ll)n), y((ll)n);
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }
  ll l = 0, r = 1.5e9;
  for (int it = 0; it < 60; it++) {
    ll mid = (l + r) * 0.5;
    ll cover = 0;
    for (int i = 0; i < n && cover < f; i++) {
      if (y[i] > mid)
        continue;
      ll dx = sqrtl(mid * mid - 1.0 * y[i] * y[i]);
      ll left = x[i] - dx, right = x[i] + dx;
      if (left <= cover) {
        cover = max(cover, right);
      }
    }
    (cover >= f ? r : l) = mid;
  }
  cout << fixed << setprecision(4) << r << 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: 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