Submission #1286676

#	Time	Username	Problem	Language	Result	Execution time	Memory
1286676		samarthkulkarni	Mobile (BOI12_mobile)	C++20	27 / 100	1099 ms	80952 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;

// #pragma GCC target ("avx2")
// #pragma GCC optimize ("O3")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize("fast-math")

#define ll long long
#define ld long double
#define vi vector<ll>
#define endl "\n"
#define pr pair<ll, ll>
#define ff first 
#define ss second
#define all(x) x.begin(), x.end()
const int mod = 1e9+7;
void _p(ll a){cout<<a<<endl;}
void _p(string a){cout<<a<<endl;}
void _p(ld a) {cout<<a<<endl;}
template <class T>
void _p(vector<T> a){for(T val:a)cout<<val<<" ";cout<<endl;}
#define debug(x) cout<<#x<<" -> ";_p(x)

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update > ordered_set;

vector<pr> move8 = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
vector<pr> move4 = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
vector<pr> move2 = {{0, 1}, {1, 0}};


void solution();
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    solution();
    return 0;
}

vector<pair<ld, ld>> a;
ld L;
ll N;
bool isValid(ld d) {
	vector<pair<ld, ld>> cords;

    	for (int i = 0; i < N; i++) {
    		if (d < abs(a[i].ss)) continue;
    		ld p = max(a[i].ff - sqrt(d*d - a[i].ss*a[i].ss), (ld)0);
    		ld q = min(a[i].ff + sqrt(d*d - a[i].ss*a[i].ss), L);

    		if (p <= q)
    			cords.push_back({p, q});

    	}
    	sort(all(cords));
    	if (cords.size() == 0) return false;

    	ld z = cords[0].ff;
    	if (z > 0 ) return true;

    	for (auto [x, y] : cords) {
    		if (z >= x) z = max(z, y);
    		else return true;
    	}

    	return z < L;
}

void solution() {
     cin >> N;
     cin >> L;

    a.resize(N);
    for (int i = 0; i < N; i++) {
    	ld x, y; cin >> x >> y;
    	a[i] = {x, y};
    }

    ld ans = 0;
	ld p = 0, q = L+1;
	while (q-p > 1e-4) {
		ld mid = (p + q)/2;
		if (isValid(mid)) {
			p = mid;
		} else{
			ans = mid;
			q = mid;
		}
	}

	cout << q << endl;



}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 0 / 5
• Subtask 11: 5 / 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