제출 #884585

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
884585		bedupako	Mobile (BOI12_mobile)	C++17	0 / 100	1064 ms	48704 KiB

mobile

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

#define all(x) x.begin(),x.end()
typedef long long ll;
const double E = 1e-9;

bool good(vector<pair<double,double>>& x, double l){
	int n = x.size();
	sort(all(x));
	stack<pair<double,double>> s;
	for(int i = 0; i < n; i++){
		if(s.empty()){
			s.push(x[i]);
		}else if(s.top().second >= x[i].first){
			s.top().second = max(s.top().second,x[i].second);
		}else{
			s.push(x[i]);
		}
	}
	if((int)s.size() == 1){
		if(abs(s.top().first) <= E and abs(s.top().second-l) <= E){
			return true;
		}
	}
	return false;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n,l;
	cin >> n >> l;
	vector<double> x(n),y(n);
	for(int i = 0; i < n; i++){
		cin >> x[i] >> y[i];
	}
	double low = 0, high = 1e+10;
	double ans = 0l;
	int cnt = 0;
	while(high - low >= E and cnt <= 100){
		cnt++;
		//cout << "Iteration "  << cnt << '\n';
		double R = (low + high)/2;
		// cout << "Radius " << R << '\n';
		vector<pair<double,double>> ranges;
		for(int i = 0; i < n; i++){
			if(R < y[i]){
				continue;
			}else{
				double val = sqrt(R*R - y[i]*y[i]);
				ranges.emplace_back(max(0/1.0,(double)x[i]-val),
														min((double)l,(double)x[i]+val));
			}
		}
		if(good(ranges,l)){
			ans = R;
			high = R - E;
		}else{
			low = R + E;
		}
	}
	cout << fixed << setprecision(6) <<  ans << '\n';
}

• 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