제출 #1281547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281547		minhphan	Mobile (BOI12_mobile)	C++20	12 / 100	587 ms	8236 KiB

mobile

#include <bits/stdc++.h>

using namespace std;

bool covers(vector<pair<int, int>> &pair, int N, double rSq, double L) {
    double covered = 0;
    for (int i = 0; i<N; i++) {
        const double deltaX = sqrt(rSq - pair[i].second*pair[i].second);
        const double a = pair[i].first - deltaX;
        double b = pair[i].first + deltaX;
        if (a <= covered) {
            covered = max(covered, b);
        }
    }
    return covered >= L;
}

int main() {
    int N, L;
    cin >> N >> L;

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

    double low = 0;
    double high = 1.5e9;

    while (high - low > 1e-3) {
        const double m = (low+high)/2;

        if (covers(pair, N, m*m, L)) {
            high = m;
        } else {
            low = m;
        }
    }

    cout << fixed << setprecision(4);
    cout << low;
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 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