제출 #998937

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
998937		hippo123	Mobile (BOI12_mobile)	C++17	12 / 100	541 ms	23632 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
 
#define pr pair<int, int>
#define ll long long
#define pb push_back
#define f first
#define s second
vector<pr> d(1000001);
int n; double L;

bool comp(pr a, pr b){
	if(a.f==b.f) return a.s*a.s<b.s*b.s;
	return a.f<b.f;
}


int main(){
	 cin>>n>>L;
	

	for (int i=0; i<n; i++) {
		cin>>d[i].f>>d[i].s; 
	}
	
	//sort(d.begin(), d.begin()+n, comp);
	
	//for (int i=0; i<n; i++) cout<<d[i].f<<" " <<d[i].s<<" :"<<endl;
	
	double lft=0; double rht=L;
	while (rht-lft>1e-5){
		double mid=lft+(rht-lft)/2;
		//cout<<" lft/rht/mid= "<<lft<<" "<<rht<<" "<<mid<<endl;

		double curr=0;
		for (int i=0; i<n; i++){
			double dx=sqrt(mid*mid-d[i].s*d[i].s);
			double x1, x2;
			x1=d[i].f-dx; x2=d[i].f+dx;
			if(x1<=curr) curr=max(curr, x2); 
		}
		if(curr>=L) rht=mid;
		else lft=mid;
	
	}
	cout << fixed <<setprecision(4);
	cout<<lft<<endl;
	
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 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