제출 #1290031

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290031		_filya_	Mobile (BOI12_mobile)	C++20	0 / 100	1098 ms	65236 KiB

mobile

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

int main()
{
// 	ifstream cin("input.txt");
//     ofstream cout("output.txt");
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	ll n, L; cin >> n >> L;
    vector<pair<double, double>> points(n);
    for (int i = 0; i < n; i++) cin >> points[i].first >> points[i].second;
    double low = 0, high = 1e9;
    while(high - low > 1e-5) {
        double mid = (low + high) / 2;
        vector<pair<double, int>> intervals;
        bool can1 = true, can2 = false;
        for (auto p : points) {
            if (abs(mid) < abs(p.second)) can1 = false;
            else {
                intervals.push_back({p.first - sqrt(mid * mid - p.second * p.second), 1});
                intervals.push_back({p.first + sqrt(mid * mid - p.second * p.second), -1});
            }
        }
        sort(intervals.begin(), intervals.end(), [&](pair<double, int>& p1, pair<double, int>& p2) {
            if (p1.first == p2.first) {
                return (p1.second > p2.second);
            } else return (p1.first < p2.first);
        });
        int cur_cnt = 0;
        for (auto& p : intervals) {
            cur_cnt += p.second;
            if (cur_cnt == n) can2 = true;
        }
        if (can1 && can2) {
            high = mid;
        } else {
            low = mid;
        }
    }
    cout << fixed << setprecision(5) << low << '\n';
}

• 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