제출 #1304010

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1304010		hamstpan	Mobile (BOI12_mobile)	C++20	0 / 100	755 ms	16064 KiB

mobile

#include<iostream>
#include<vector>
#include<functional>
#include<algorithm>
#include<cmath>
using namespace std;
double first_true(double lo, double hi, function<bool(double)> f) {
	hi += 1e-4;
	while (lo + 1e-4 < hi) {
		double mid = lo + (hi - lo) / 2;
		if (f(mid)) hi = mid;
		else lo = mid + 1e-4;
	}
	return lo;
}
int main() {
	int n, l;
	cin >> n >> l;
	vector<pair<double, double>> a(n);
	for (auto& i : a) cin >> i.first >> i.second;
	cout << first_true(0, l, [&](double r) {
		double mincovered = -1;
		int i = 0;
		while (i < n) {
			while (r < a[i].second) ++i; //this doesn't do anything
			if (a[i].first - sqrt(r * r - a[i].second * a[i].second) < mincovered) mincovered = a[i].first + sqrt(r * r - a[i].second * a[i].second);
			++i;
		}
		return mincovered >= l;
		});
}

• 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