Submission #654939

#	Time	Username	Problem	Language	Result	Execution time	Memory
654939		Koful123	Mobile (BOI12_mobile)	C++17	0 / 100	1097 ms	31632 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
//#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

const double eps = 0.0000000000000001;

double dis(pair<double,double> x,pair<double,double> y){
	return sqrt(pow(x.ff - y.ff,2) + pow(x.ss - y.ss,2));
}

void solve(){

	double n,k;
	cin >> n >> k;

	vector<pair<double,double>> v(n);
	for(auto &[x,y] : v){
		cin >> x >> y;
	}

	auto check = [&](double m,double i,int ty){
		double d = 1e18,e = 1e18;
		for(int j=0;j<i;j++){
			d = min(d,dis({m,0},v[j]));
		}
		for(int j=i;j<n;j++){
			e = min(e,dis({m,0},v[j]));	
		}
		return (ty ? d : d <= e);
	};

	double ans = 0;
	for(int i=1;i<n;i++){
		double l = 0,r = k;
		for(int j=1;j<=66;j++){
			double m = (l + r + eps) / 2;
			if(check(m,i,0)) l = m;
			else r = m - eps;
		}
		ans = max(ans,check(l,i,1));
	}

	cout << fixed << setprecision(10);
	cout << ans << endl;
}	

signed main(){

	ios::sync_with_stdio(0);
	cin.tie(0);

	int t = 1;
//	cin >> t;

	while(t--)
		solve();

	return 0;
}

• 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