제출 #1212807

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212807		nguyenkhangninh99	Mobile (BOI12_mobile)	C++20	100 / 100	679 ms	31716 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int n, L; cin >> n >> L;
    vector<array<int, 2>> a(n);
    for(int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1];
    
    double l = 0, r = 1e9;
    
    for(int _ = 0; _ <= 50; _++){
        double mid = (l + r) / 2;
        
        vector<array<double, 2>> cover(n);
        for (int i = 0; i < n; i++) {
            if(a[i][1] > mid) cover[i][0] = cover[i][1] = -1e18;
            else{
                cover[i][0] = a[i][0] - sqrt(mid * mid - a[i][1] * a[i][1]);
                cover[i][1] = a[i][0] + sqrt(mid * mid - a[i][1] * a[i][1]);
            }
        }

        double cur = 0;
        for (int i = 0; i < n; i++) {
            if (cover[i][0] > cur) continue;
            cur = max(cur, cover[i][1]);
        }

        if(cur >= L) r = mid;
        else l = mid;
    }
    cout << fixed << setprecision(10) << l;

}

• 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