제출 #1268670

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1268670		escobrand	Mobile (BOI12_mobile)	C++20	0 / 100	789 ms	16092 KiB

mobile

#include <bits/stdc++.h>

using namespace std;
#define all(v) v.begin(),v.end()
#define pb push_back
#define ll long long
#define ld long double
#define fi first
#define se second
#define mk make_pair
typedef pair<ll,ll> pii;

int i,n,t;
const int maxn = 1e6 + 10;
pii a[maxn];
ll m;

bool check(ld r)
{
    ld pos = 0;
    for(int i = 0;i<n&&pos<m;i++)
    {
        ll x = a[i].fi;
        ll y = a[i].se;
        ld tmp = max((ld)0 , sqrt(r - y*y));
        if(pos < -tmp+x)return 0;
        pos = max(pos,tmp+x);
    }
    return pos >= m;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    // freopen("a.INP","r",stdin);
    // freopen("a.OUT","w",stdout);

    cin>>n>>m;
    for(i = 0;i<n;i++)
    {
        cin>>a[i].fi>>a[i].se;
    }

    sort(a,a+n);

    ld l = 0,r = 2e18;
    int t = 100;
    while(t--)
    {
        ld mid = (l + r)/2;
        if(check(mid))r = mid;
        else l = mid;
    }

    cout<<sqrt(l);

    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