제출 #1278633

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1278633		PlayVoltz	Mobile (BOI12_mobile)	C++20	100 / 100	342 ms	16076 KiB

mobile

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
using namespace std;
 
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, l;
	cin>>n>>l;
	vector<pii> vect(n);
	for (int i=0; i<n; ++i)cin>>vect[i].fi>>vect[i].se;
	long double low=0, high=1500000000;
	while (low+0.00001<high){
		long double mid=(low+high)/2, mx=0;
		for (int i=0; i<n; ++i){
			if (abs(vect[i].se)>mid)continue;
			long double d=sqrt(mid*mid-vect[i].se*vect[i].se);
			if (vect[i].fi-d<=mx)mx=max(mx, vect[i].fi+d);
		}
		if (mx>=l)high=mid;
		else low=mid;
	}
	cout<<fixed<<setprecision(9)<<high;
}

• 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