제출 #398754

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398754		ritul_kr_singh	Mobile (BOI12_mobile)	C++17	100 / 100	754 ms	35308 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'

vector<array<double, 2>> a;
int n; double l;

bool possible(double x){
	double last = 0, w;
	for(auto &i : a){
		if(x * x < i[1]) continue;
		w = sqrt(x * x - i[1]);
		if(last >= i[0] - w) last = max(last, i[0] + w);
	}
	return last >= l;
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> l;
	a.resize(n);
	for(auto &i : a) cin >> i[0] >> i[1], i[1] *= i[1];

	double low = 0, high = 4e9;
	for(int _=0; _<45; ++_){
		double mid = (low + high) / (double) 2.0;
		if(possible(mid)) high = mid - 1e-5;
		else low = mid;
	}

	cout << fixed << setprecision(5) << low;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5