제출 #633268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633268		afatpotato	Mobile (BOI12_mobile)	C++14	100 / 100	429 ms	16032 KiB

mobile

#include <bits/stdc++.h>

using namespace std;



pair<long long, long long> tower[1000000];
long long n, l;

int main() {
    ios_base::sync_with_stdio(0);
	cin.tie(0);
    cin >> n >> l;
    for (int i = 0; i < n; i++) {
        cin >> tower[i].first >> tower[i].second;
    }

    double low = 0;
    double high = 1.5e9;

    while (high - low > 1e-3) {
        double mid = (low + high) / 2;
        double cur = 0;
        for (int i = 0; i < n; i++) {
            double delta = sqrt(mid * mid - tower[i].second * tower[i].second);
            double a = tower[i].first - delta;
            double b = tower[i].first + delta;
            if (a <= cur) {
                cur = max(cur, b);
            }
        }
        if (cur > l) {
            high = mid;
        } else {
            low = mid;
        }
    }
    cout << fixed;
    cout << setprecision(4);
    cout << low << 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