Submission #1215734

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215734		rkgena	Mobile (BOI12_mobile)	C++20	100 / 100	239 ms	15944 KiB

mobile

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#define lli long long int
#define pb push_back
#define all(x) x.begin(),x.end()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repp(i,a,b) for(int i=a;i>=b;i--)
#define vi vector<lli>
#define vvi vector<vi>
#define vpi vector<pair<lli,lli>>
#define pi pair<lli,lli>
#define msi multiset<lli>
#define mspi multiset<pair<lli,lli>>
#define mii map<lli,lli>
#define mpi map<pair<lli,lli>,lli>
#define si set<lli>
#define spi set<pair<lli,lli>>
#define qi queue<lli>
#define pqi priority_queue<lli>
#define pqimin priority_queue<lli,vi,greater<lli>>
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T1, class T2> using ordered_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;
void solve() {
    lli n,l;
    cin>>n>>l;

    vpi points(n);
    rep(i,0,n-1)cin >> points[i].first >> points[i].second;

    double lo = 0.0, hi = 1e9 * 1.0;
    while(lo + 1e-3 <= hi){
        double mid = (hi+lo)/2.0;

        double xmax = 0;
        rep(i,0,n-1){
            if(abs(points[i].second) >= mid) continue;

            double left = points[i].first - sqrt(mid*mid - points[i].second*points[i].second);
            double right = points[i].first + sqrt(mid*mid - points[i].second*points[i].second);

            if(left <= xmax)xmax = max(xmax, right);
        }
        if(xmax >= l){
            hi = mid;
        }
        else{
            lo = mid;
        }
    }
    cout<<fixed<<setprecision(6)<<lo<<"\n";
}
 
signed main() {
    IOS 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