Submission #623053

#	Time	Username	Problem	Language	Result	Execution time	Memory
623053		54skyxenon	Mobile (BOI12_mobile)	C++17	8 / 100	1092 ms	40300 KiB

mobile

// https://oj.uz/problem/view/BOI12_mobile

#include <bits/stdc++.h>
using namespace std;

#define EPS 0.0001
#define pdd pair<double, double>
#define mp make_pair

int n, l;
vector<int> X, Y;

vector<pdd> merge(vector<pdd>& intervals) {
    sort(intervals.begin(), intervals.end());

    vector<pdd> new_intervals;
    for (auto [start, end] : intervals) {
        if (new_intervals.empty() || new_intervals.rbegin()->second < start) {
            new_intervals.push_back(mp(start, end));
        }
        else {
            new_intervals.rbegin()->second = max(new_intervals.rbegin()->second, end);
        }
    }
    
    return new_intervals;
}

bool ok(double radius) {
    vector<pdd> intervals({mp(0, 0), mp(l, l)});
    
    for (int i = 0; i < n; i++) {
        double x1 = X[i], y1 = Y[i];
    
        double term = (radius * radius) - (y1 * y1);
        if (term >= 0) {
            double term_sqrt = sqrt(term);
            intervals.push_back(mp(x1 - term_sqrt, x1 + term_sqrt));
        }
    }
        
    intervals = merge(intervals);

    for (int i = 0; i < intervals.size() - 1; i++) {
        double midpt = (intervals[i].second + intervals[i + 1].first) / 2;
        if (0 <= midpt && midpt <= l) {
            return true;
        }
    }

    return false;
}

int main() {
    cin >> n >> l;

    X.resize(n);
    Y.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> X[i] >> Y[i];
    }

    double lo = 0.0;
    double hi = l;

    int threshold = 100;
    while (threshold--) {
        double mid = (lo + hi) / 2;

        if (!ok(mid)) {
            hi = mid;
        }
        else {
            lo = mid;
        }
    }

    cout << lo << endl;
}

Compilation message (stderr)

mobile.cpp: In function 'bool ok(double)':
mobile.cpp:44:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<double, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for (int i = 0; i < intervals.size() - 1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~

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