제출 #1249179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249179		somefolk	Mobile (BOI12_mobile)	C++20	60 / 100	1096 ms	48172 KiB

mobile

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
#define int long long

const int INF = 1e9+7;
const int MOD = 1e9+7;

void solve(){
    int n;
    double m;
    cin >> n >> m;

    vector<pair<double, double>> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i].first >> a[i].second;
    }

    auto check = [&](double R){
        vector<pair<double, double>> pt;
        for(auto &[x, y] : a){
            pt.push_back({x-sqrt(R*R-y*y), x+sqrt(R*R-y*y)});
        }

        double r = 0;
        for(int i = 0; i < pt.size(); i++){
            if(pt[i].first <= r){
                r = max(r, pt[i].second);
            }
        }

        return (r >= m);
    };

    double l = 0, r = 1e18, sol = 0;
    while(r-l > 1e-6){
        double mid = (l+r)/2;
        if(check(mid)){
            sol = mid;
            r = mid;
        } else {
            l = mid;
        }
    }

    cout << fixed << setprecision(6) << sol << endl;
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    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: 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