제출 #678864

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
678864		scrge	Mobile (BOI12_mobile)	C++17	0 / 100	257 ms	5492 KiB

mobile

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

int n, l;
pair<double, double> base[100000];

bool check(double r){
	pair<double, double> seg[100000];
	for(int i = 0; i < n; i++){
		double x = base[i].first, y = base[i].second;
		if(r*r < y*y) continue;
		double d = sqrt(r*r-y*y);
		seg[i] = {max((double)0, x-d), min(x+d, (double)l)};
	}

	sort(seg, seg+n);
	
	double right = 0;	
	for(int i = 0; i < n; i++){
		if(seg[i].first > right) return true;
		right = max(right, seg[i].second);
	}
	return false;
}

int main(){
	cin >> n >> l;
	for(int i = 0; i < n; i++)
		cin >> base[i].first >> base[i].second;

	double l = 0, r = INT_MAX;
	while(l+1e-4 < r){
		double mid = (l+r)/2;
		if(check(mid)) l = mid;
		else r = mid;
	}

	cout << l << endl;
}

• 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