제출 #1217041

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1217041		prism7k	Mobile (BOI12_mobile)	C++20	8 / 100	481 ms	8244 KiB

mobile

#include <bits/stdc++.h>
using namespace std;

double bin_search(double l, double r, function<bool(double)> f) {
	while(r - l > 1e-5) {
		double mid = l + (r - l) / 2;
		if(f(mid)) {
			r = mid;
		} else {
			l = mid;
		}
	}
	return l;
}

int main() {
	int N, L; cin >> N >> L;
	vector<pair<int, int>> pts(N);
	for(int i = 0; i < N; ++i) {
		int x, y; cin >> x >> y;
		y = abs(y);
		pts[i] = {x, y};
	}
	
	cout << bin_search(0, 2e9, [&](double rad) {
		
		double curr = 0.0;
		for(int i = 0; i < N; ++i) {
			double X = pts[i].first, Y = pts[i].second;
			if(Y > rad) continue;
			double delta = sqrt(rad * rad - Y * Y);
			double left_isect = X - delta, right_isect = X + delta;
			if(left_isect <= curr) curr = max(curr, right_isect);
		}
		
		return curr >= L;
	}) << "\n";
}

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