제출 #1290056

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290056		_filya_	Mobile (BOI12_mobile)	C++20	100 / 100	323 ms	16028 KiB

mobile

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

int main() {
    // ifstream cin("input.txt");
    // ofstream cout("output.txt");
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    ll n, L;
    cin >> n >> L;
    vector<pair<ll, ll>> points(n);
    for (int i = 0; i < n; i++) {
        cin >> points[i].first >> points[i].second;
    }

    long double low = 0, high = 2e9;
    while (high - low > 1e-3) {
        long double mid = (low + high) / 2;
        long double covered = 0;
        for (auto& p : points) {
            if (abs(p.second) > mid) continue;
            long double dx = sqrt(mid * mid - (long double)(p.second) * (p.second));
            long double left = p.first - dx;
            long double right = p.first + dx;
            if (left <= covered) covered = max(covered, right);
        }        
        if (covered >= L) {
            high = mid;
        } else {
            low = mid;
        }
    }
    
    cout << fixed << setprecision(5) << low << '\n';
    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