제출 #1208766

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1208766		catsarecool5530	Mobile (BOI12_mobile)	C++20	0 / 100	1097 ms	48172 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n";
#define all(x) x.begin(), x.end()
#define int long long
int MOD = 1e9 + 7;
const ll INF = 1e18;


void solve() {
    int n, l; cin >> n >> l;
    vector<array<int, 2>> arr(n);
    for (int i = 0; i < n; i++) {
        cin >> arr[i][0] >> arr[i][1];
    }
    auto works = [&](double r) {
        vector<array<double, 2>> cover;
        for (int i = 0; i < n; i++) {
            if (arr[i][1] > r) {
                continue;
            }
            cover.push_back({arr[i][0] - sqrt(r * r - arr[i][1] * arr[i][1]),
                             arr[i][0] + sqrt(r * r - arr[i][1] * arr[i][1])});
        }
        sort(all(cover), [](const array<double, 2>& a, const array<double, 2>& b) {
            return a[0] < b[0];
        });
        double cur = 0;
        for (int i = 0; i < n; i++) {
            if (cover[i][0] > cur) continue;
            cur = max(cur, cover[i][1]);
        }
        return cur >= l;
    };
    double l1 = 0, r = 1.5e9;
    while (r - l1 > 1e-6) {
        double mid = (l1 + r) / 2;
        if (works(mid)) {
            r = mid;
        } else {
            l1 = mid;
        }
    }
    cout << fixed << setprecision(10) << l1 << endl;

}
 
signed main() {
    ios::sync_with_stdio(0); cin.tie(NULL);
    // freopen("walk.in", "r", stdin);
    // freopen("walk.out", "w", stdout);
    ll t = 1; // cin >> t;
    while (t--) {
        solve();
    }
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 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