제출 #1294383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1294383		srittheboss	Mobile (BOI12_mobile)	C++20	0 / 100	238 ms	16096 KiB

mobile

#include "bits/stdc++.h"
#define INF 1e18
using namespace std;

bool test(int n, int l, double r, vector<pair<double, double>> stations) {
    vector<pair<double, double>> intervals;

    for (int i = 0; i < n; i++) {
        if (stations[i].second >= -r && stations[i].second <= r) {
            double x = stations[i].first;
            double y = stations[i].second;
            double lower = x - sqrt(pow(r, 2) - pow(y, 2));
            double upper = x + sqrt(pow(r, 2) - pow(y, 2));
            intervals.push_back({lower, upper});
        }
    }

    stack<pair<double, double>> s;

    for (auto interval : intervals) {
        while (!s.empty() && s.top().second >= interval.first) {
            interval = {min(interval.first, s.top().first), max(interval.second, s.top().second)};
            s.pop();
        }
        s.push(interval);
    }

    while (!s.empty()) {
        if (s.top().first <= 0 && s.top().second >= l) {
            return true;
        }
        s.pop();
    }

    return false;

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n, l;
    cin >> n >> l;
    vector<pair<double, double>> stations(n);

    for (int i = 0; i < n; i++) {
        cin >> stations[i].first >> stations[i].second;
    }

    double lo = 0, hi = 1.1e9;

    while (hi - lo < 1e-3) {
        double mid = lo + (hi - lo) / 2;
        if (test(n, l, mid, stations)) {
            hi = mid;
        } else {
            lo = mid + 1;
        }
    }

    cout << lo << endl;


}

• 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