Submission #1302633

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302633		ivycube	Mobile (BOI12_mobile)	C++20	100 / 100	287 ms	9148 KiB

mobile

#include <iostream>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <cmath>

#define x first
#define y second

using namespace std;

int N, L;
pair<int, int> P[1000000];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> N >> L;
    for (int i = 0; i < N; i++)
        cin >> P[i].x >> P[i].y;
    
    double lo = 1.0, hi = 1.5e9;
    while (hi - lo > 1e-3) {
        double mid = lo + (hi - lo)/2;
        double cur = 0.0;
        for (int i = 0; i < N; i++) {
            double half_chord = sqrt(mid * mid - (double)P[i].y * P[i].y);
            double l = P[i].x - half_chord, r = P[i].x + half_chord;
            if (l <= cur) cur = max(cur, r);
        }
        if (cur >= L) hi = mid;
        else lo = mid;
    }

    cout << fixed << setprecision(4) << lo << 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: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5