제출 #732533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
732533		uy842003	Mobile (BOI12_mobile)	C++17	80 / 100	1077 ms	15912 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
 
const double eps = 1e-4;
pair<double, double> cor[1000001];
 
int main() {
 
    int n;
    double len;
    cin >> n >> len;
    for (int i = 0; i < n; i++)
        cin >> cor[i].first >> cor[i].second;
    double l = 0, r = 4e9 + 1, m;
    while (r - l > eps) {
        m = (l + r) / 2;
        double cur_pos = 0;
        for (int i = 0; i < n; i++) {
            if (m < abs(cor[i].second) + eps) continue;
            double dx = sqrt(m * m - cor[i].second * cor[i].second);
            if (cor[i].first - dx < cur_pos + eps) cur_pos = max(cur_pos, cor[i].first + dx);
        }
        if (len < cur_pos + eps)
            r = m;
        else
            l = m + eps;
    }
    cout << setprecision(3) << fixed << r << endl;
 
    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: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5