제출 #1016376

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1016376		cryptobunny	Mobile (BOI12_mobile)	C++14	100 / 100	955 ms	51708 KiB

mobile

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

int main() {
    int n, sz;
    cin >> n >> sz;
    vector<pair<long long, long long>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
    }
    double l = 1, r = 2e9;
    while (r - l > 1e-3) {
        double mid = (l + r) / 2, j = 0;
        vector<pair<int, int>> s;
        for (int i = 0; i < n; i++) {
            double temp = sqrt(mid * mid - a[i].second * a[i].second);
            double left = a[i].first - temp, right = a[i].first + temp;
            s.push_back({left, right});
            if (left <= j) j = max(j, right);
        }
        if (j >= sz) r = mid;
        else l = mid;
    }
    cout << fixed << setprecision(6) << l << endl;
}

• 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