Submission #1222968

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222968		iamhereforfun	Mobile (BOI12_mobile)	C++20	0 / 100	1098 ms	16932 KiB

mobile

// IamHereForFun //

#include <bits/stdc++.h>

using namespace std;

#define LSOne(X) ((X) & -(X))

const int N = 1e6 + 5;
const int M = 15;
const int C = 26;
const int LG = 20;
const int R = 25e3 + 5;
const int B = 100;
const int O = 3e5 + 5;
const int INF = 1e9 + 5;
const int MOD = 998244353;
const int nx[] = {0, 1, 0, -1}, ny[] = {1, 0, -1, 0};

long long n, l;
vector<pair<long long, long long>> points;

bool chk(long double i)
{
    long double cur = 0;
    for(pair<long long, long long> p : points)
    {
        long double j = i*i - p.second*p.second;
        // if(j < 0) continue;
        j = sqrt(j);
        if(cur >= p.first - j) cur = p.first + j;
    }
    return cur >= l;
}

void solve()
{
    cin >> n >> l;
    for(int x = 0; x < n; x++)
    {
        int a, b; cin >> a >> b;
        points.push_back({a, b});
    }
    long double l = 0, r = 3e9;
    while(r - l > 1e-5)
    {
        long double m = (l + r)/2;
        if(!chk(m))        
        {
            l = m;
        }
        else
        {
            r = m;
        }
    }
    cout << fixed << setprecision(5) << l << "\n";
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    for (int x = 1; x <= t; x++)
    {
        solve();
    }
    return 0;
}

• 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