제출 #670285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
670285		RadicaI	Mobile (BOI12_mobile)	C++17	100 / 100	971 ms	15952 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
	int n,siz; cin >> n>>siz;
	pair<ll, ll> stations[n];
	for(int i=0; i<n; i++) cin >> stations[i].first >> stations[i].second;
	double l = 1; double r = 1.5e9;
	while(r - l > 1e-3){
		double m = (l+r)/2.0;
		double store=0;
		for(int i=0; i<n; i++){
			if(abs(stations[i].second) <=m){
				double change = sqrt(m*m-stations[i].second*stations[i].second);
				double ph = stations[i].first + change;
				double pl = stations[i].first - change;
				if(pl<=store) store = max(store, ph);
			}
		}
		if(store>=siz) r=m;
		else l=m;
		
	}
	cout << fixed << setprecision(4)<< l;
}

• 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