Submission #708966

#	Time	Username	Problem	Language	Result	Execution time	Memory
708966		mmaiti	Mobile (BOI12_mobile)	C++11	8 / 100	729 ms	15956 KiB

mobile

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

vector<pair<long long, long long>> coords;

double eps = 1e-3;
int N, L;
bool not_works(double val)
{
    double curr = 0;
    for(int i = 0; i < N; i++)
    {
        double temp_begin = coords[i].first - sqrt(val*val - coords[i].second*coords[i].second);
        double temp_end = coords[i].first + sqrt(val*val - coords[i].second*coords[i].second);

        if(temp_begin <= curr)
        curr = max(curr, temp_end);
    }
    if(curr >= L)
    return true;
    else
    return false;
}
int main()
{
    
    cin >> N >> L;
    coords.resize(N);

    for(int i = 0; i < N; i++)
    {
        cin >> coords[i].first >> coords[i].second;
    }

    double lo = 1;
    double hi = 1.5e9;
    double mid;

    while(abs(hi-lo) > eps)
    {
        mid = (lo + hi)/2;
        if(not_works(mid))
        hi = mid;
        else
        lo = mid;
    }
    
    cout << setprecision(6) << lo << "\n";
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 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