제출 #1332364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1332364		ug12	Mobile (BOI12_mobile)	C++20	0 / 100	1098 ms	48220 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using pii = pair<double, double>;
#define x first
#define y second

const int N = 1e6 + 5, M = 1e6 + 5;
const double eps = 1e-3;
int n, len;
vector<pii> a(N);

bool check(double mid){
    
    vector<pii> p;
    double t = mid * mid;
    for(int i = 1;i <= n;i++){
        double h = abs(a[i].y);
        if(h >= mid) continue;
        p.push_back({a[i].x - sqrt(t - h * h), a[i].x + sqrt(t - h * h)});  
    }

    sort(p.begin(), p.end());

    double r = p[0].second;
    for(pii &i : p){
        if(i.x > r) return false;
        r = max(r, i.y);
    }

    return r >= len;

}

void solve(){

    cin >> n >> len;
    for(int i = 1;i <= n;i++) cin >> a[i].x >> a[i].y;

    double l = 0, r = 1e9, mid;
    while(r - l >= eps){
        mid = (l + r) / 2;
        if(check(mid)) r = mid - eps;
        else l = mid + eps;
    }

    cout << r + eps;

}
 
signed main(){
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

    solve();
 
    return 0;
}

• 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