제출 #217140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
217140		dolphingarlic	Mobile (BOI12_mobile)	C++14	0 / 100	736 ms	16164 KiB

mobile

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define x first
#define y second
using namespace std;

pair<long long, long long> p[1000000];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, len;
    cin >> n >> len;
    FOR(i, 0, n) cin >> p[i].x >> p[i].y;

    double l = 1, r = 5e8;
    while (r - l > 1e-3) {
        double mid = (l + r) / 2, curr = 0;
        FOR(i, 0, n) {
            double delta = hypot(mid, p[i].y);
            double a = p[i].x - delta, b = p[i].x + delta;
            if (a <= curr) curr = max(curr, b);
        }

        if (curr >= len) r = mid;
        else l = mid;
    }

    cout << fixed << setprecision(4) << l;
    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