Submission #1215916

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215916		newsboy	Mobile (BOI12_mobile)	C++20	100 / 100	413 ms	16020 KiB

mobile

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <tuple>
#include <cassert>
#include <array>
#include <list>
#include <random>
#include <initializer_list>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using db = double;
using ld = long double;
constexpr i64 INF = 1E18;
constexpr i64 MIN = -INF;
constexpr i64 MAX = INF;
constexpr int N = 1E4 + 10;

struct Point {
    i64 x, y;
};

void solve() {
    int n, L;
    cin >> n >> L;
    vector<Point> points(n);
    for (int i = 0; i < n; ++i) {
        cin >> points[i].x >> points[i].y;
    }
    db lo = 0.5, hi = 1.5E9;
    for (int _ = 0; _ < 60; ++_) {
        db mid = (lo + hi) / 2, maxr = 0;
        for (int i = 0; i < n; ++i) {
            db dx = sqrt(mid * mid - points[i].y * points[i].y);
            db l = points[i].x - dx, r = points[i].x + dx;
            if (l <= maxr) {
                maxr = max(maxr, r);
            }
        }
        if (maxr >= L) {
            hi = mid;
        }
        else {
            lo = mid;
        }
    }
    cout << hi << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed << setprecision(10);
    int t = 1;
    /*cin >> t;*/
    while (t--) {
        solve();
    }
    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