제출 #829479

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
829479		soumyojit_sen	Mobile (BOI12_mobile)	C++14	0 / 100	663 ms	24616 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> pts;
int n,L;

bool works(double d){
	double left = DBL_MIN, right = DBL_MAX;

	for(int i = 0; i < n; i++){
		left = max(left, pts[i].first - sqrt(d*d - pts[i].second*pts[i].second));
		right = min(right, pts[i].first + sqrt(d*d - pts[i].second*pts[i].second));
	}
	return left <= right;
}

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

	double bad = -1.0;
	double good = 2e9;
	for(int i = 0; i < 60; i++){
		double mid = bad + (good - bad)/2.0;
		if(works(mid)){
			good = mid;
		} else {
			bad = mid;
		}
	}
	cout << fixed << setprecision(6) << good;
}

• 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