제출 #1121419

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1121419		steveonalex	Mobile (BOI12_mobile)	C++17	0 / 100	1066 ms	48716 KiB

mobile

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll gcd(ll a, ll b){return __gcd(a, b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n"){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }


template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

void solve(){
    int n, L; cin >> n >> L;
    vector<pair<ll, ll>> a(n);
    for(int i = 0; i<n; ++i) cin >> a[i].first >> a[i].second;

    double l = 0, r = 2e9;
    for(int i = 0; i < 60; ++i) {
        double mid = (l + r) / 2;
        vector<pair<double, double>> range;
        for(pair<ll, ll> j: a){
            if (j.second > mid) continue;
            double r = sqrt(mid * mid - j.second * j.second);
            pair<double, double> cur = {j.first - r, j.first + r};
            maximize(cur.first, 0); minimize(cur.second, L);
            range.push_back(cur);
        }
        range.push_back({L, L});

        sort(ALL(range));
        double ma = 0;
        bool check = true;
        for(pair<double, double> j: range){
            if (j.first > ma) check = false;
            maximize(ma, j.second);
        }

        if (check) r = mid;
        else l = mid;
    }

    cout << fixed << setprecision(6) << l << "\n";
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    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