Submission #1289965

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289965		becastal	Mobile (BOI12_mobile)	C++20	12 / 100	1096 ms	8256 KiB

mobile

#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
using namespace std;

int solve() {
	int n, tam; cin >> n >> tam;
	vector<array<int, 2>> A(n);
	for (auto& [x, y] : A) {
		cin >> x >> y;
	}
	sort(all(A));

	double l = 1, r = 1e12;
	for (int rep = 0; rep < 1000; rep++) {
		double mid = 0.5 * (l + r), agr = 0;

		for (int i = 0; i < n; i++) {
			double delta = sqrt(mid * mid - A[i][1] * A[i][1]);
			double a = A[i][0] - delta, b = A[i][0] + delta;
			if (a <= agr) agr = max(agr, b);
		}

		if (agr >= tam) r = mid;
		else l = mid;
	}
	cout << fixed << setprecision(13) << l << endl;

	return(0);
}

int main()
{
    _;

	int t = 1; //cin >> t;
	while (t--) {
		solve();
	}
    
    return(0);
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 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