제출 #1201809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1201809		Alfraganus	Mobile (BOI12_mobile)	C++20	0 / 100	1096 ms	31560 KiB

mobile

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

#define ll long long
#define fs first
#define ss second
#define str string
#define endl '\n'
#define all(a) a.begin(), a.end()

#define print(a)          \
    for (auto x : a)      \
        cout << x << ' '; \
    cout << endl;

#define printmp(a)   \
    for (auto x : a) \
        cout << x.fs << ' ' << x.ss << endl;

#define matrix(a)             \
    for (auto x : a) {        \
        for (auto y : x)      \
            cout << y << ' '; \
        cout << endl;         \
    }

const int mod = 1e9 + 7;

void solve() {
    int n;
    long double L;
    cin >> n >> L;
    vector<array<long double, 2>> a(n);
    for(int i = 0; i < n; i ++)
        cin >> a[i][0] >> a[i][1];
    sort(all(a));
    
    auto dist = [&](long double x){
        long double mn = 5e18;
        for(int i = 0; i < n; i ++)
            mn = min(mn, abs(x - a[i][0]) * abs(x - a[i][0]) + a[i][1] * a[i][1]);
        return mn;
    };


    long double mn = 5e18, ans = -1;
    for(int i = 0; i < n - 1; i ++){
        long double l = min(L, max((long double)0, a[i][0])), r = min(L, max((long double)0, a[i + 1][0]));
        for(int i = 0; i < 100; i ++){
            long double mid1 = l + (r - l) / 3.0, mid2 = r - (r - l) / 3.0;
            if(dist(mid1) > dist(mid2))
                r = mid2;
            else
                l = mid1;
        }
        if(mn > dist(l))
            mn = dist(l), ans = l;
    }
    cout << fixed << setprecision(5) << ans;
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << 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