제출 #1216047

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1216047		jakeob77	Mobile (BOI12_mobile)	C++17	0 / 100	755 ms	39584 KiB

mobile

#include <bits/stdc++.h>
#include <bits/extc++.h> 
using namespace std;
//using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define ins insert
//cout<<fixed<<setprecision(3); 3 decimalke brez fixed pa 3 zanesljiva mesta
const int MAXN=2e5+2;
const long long linf=1e18;
const int inf=1e9;
const int mod=1e9+7;

void solve(){
    int n,m;cin>>n>>m;
    vector<int>a(n),b(n);
    for(int i=0;i<n;i++) {
        cin>>a[i]>>b[i];
        b[i]=abs(b[i]);
    }
    auto f=[&](long double r)->bool{
        vector<pair<long double,long double>>interval(n);
        for(int i=0;i<n;i++){
            if(r<=b[i]) return false;
            long double d=sqrt(r*r-b[i]*b[i]);;
            interval[i].first=a[i]-d;
            interval[i].second=a[i]+d;
        }
        for(int i=0;i<n;i++){
            if(i==0){
                if(interval[i].first>0) return false;
            }
            else{
                if(i==n-1){
                    if(interval[i].second<m) return false;
                }
                if(interval[i].first>interval[i-1].second) return false;
            }
        }
        return true;
    };

    long double l=0,r=1e10;long double e=0.00001;
    while(r-l>e){
        long double mid=l+(r-l)/2;
        if(f(mid)){
            r=mid;
        }
        else l=mid;
    }
    cout<<l<<endl;
}
int main(){
    std::ios::sync_with_stdio(false);
	std::cin.tie(NULL); 
    int t=1;
    while(t--) solve();
}

• 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