Submission #1141012

#	Time	Username	Problem	Language	Result	Execution time	Memory
1141012		hellowinchang1029	Mobile (BOI12_mobile)	C++20	30 / 100	1096 ms	31560 KiB

mobile

#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vector<vector<int>>
#define vt vector
#define arr array
#define ALL(x) begin(x), end(x)
#define rALL(x) rbegin(x), rend(x)
#define SZ(x) x.size()
#define P(x, y) make_pair(x, y)
const int MOD1=998244353;
const int MOD2=1e9+7;
const ll LINF=1e18;
const int INF=1e9;

ll N;
ld L;
vt<pair<ld, ld>> points;

bool valid(ld d){
    ld covered = 0;
    for (auto [x, y] : points){
        // x ^ 2 + y ^ 2 = r ^ 2
        ld dist = sqrt(d * d - y * y);
        if (x - dist <= covered) covered = max(covered, x + dist);
    }
    return covered >= L;
}
 
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    cin >> N >> L;
    points.resize(N);
    for (auto &[x, y] : points) cin >> x >> y;

    ld l = 0, r = 1.5e9;
    for (int i = 0; i < 40; i++){
        ld m = (l + r) / 2;
        if (valid(m)) r = m;
        else l = m;
    }
    cout << fixed << setprecision(10) << (l + r) / 2 << '\n';
    
    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: 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