Submission #832562

#	Time	Username	Problem	Language	Result	Execution time	Memory
832562		Lalic	Mobile (BOI12_mobile)	C++17	100 / 100	588 ms	35324 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1e9+7;
const int MAXN = 2e5+5;
 
void solve(){
	int n; double l; cin >> n >> l;
	vector<pair<double, double>> arr(n);
	for(int i=0;i<n;i++) cin >> arr[i].fi >> arr[i].se;

	double lo=0, hi=1e10;
	while(hi-lo>=0.0001){
		double mid=lo+(hi-lo)/2;

		double lim=0;
		for(int i=0;i<n;i++){
			double dist=sqrt(mid*mid-arr[i].se*arr[i].se);
			if(arr[i].fi-dist<=lim) lim=max(lim, arr[i].fi+dist);
		}

		if(lim>=l) hi=mid;
		else lo=mid;
	}

	cout.precision(3);
	cout.setf(ios::fixed);

	cout << lo << "\n";
}
 
int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
 
	// freopen("loan.in","r",stdin);
    // freopen("loan.out","w",stdout);
 
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}

• 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