#include #include using namespace std; using i32 = int; using u32 = unsigned int; using i64 = long long; using u64 = unsigned long long; #define FAST_IO \ ios::sync_with_stdio(false); \ cin.tie(0); const i64 INF = 1001001001001001001; using Modint = atcoder::static_modint<998244353>; int N; double H; vector x, y; double L(double a1, double a2) { double ret = 0; for (int i = 0; i < N; i++) { double y1 = a1 * x[i] + H/2; double y2 = a2 * x[i] - H/2; ret += min(pow(y1 - y[i], 2), pow(y2 - y[i], 2)); } return ret; } pair ternary_search(double mn, double mx, function f, int iter) { double l = mn, r = mx; for (int i = 0; i < iter; i++) { double theta1 = (l * 2 + r) / 3; double theta2 = (l + r * 2) / 3; if (f(theta1) < f(theta2)) { r = theta2; } else { l = theta1; } } return {l, f(l)}; } tuple search(double min_alpha, double max_alpha) { int iter = 100; auto ans = ternary_search(min_alpha, max_alpha, [&](double alpha) { double max_beta = min(abs(M_PI / 2 - alpha), abs(alpha - (-M_PI / 2))); double min_beta = -max_beta; auto v = ternary_search(min_beta, max_beta, [&](double beta) { return L(tan(alpha + beta), tan(alpha - beta)); }, iter); return v.second; }, iter); auto alpha = ans.first; double max_beta = min(abs(M_PI / 2 - alpha), abs(alpha - (-M_PI / 2))); double min_beta = -max_beta; auto v = ternary_search( min_beta, max_beta, [&](double beta) { return L(tan(alpha + beta), tan(alpha - beta)); }, iter); auto beta = v.first; return {alpha, beta, v.second}; } int main() { FAST_IO cin >> N >> H; x.resize(N); y.resize(N); for (int i = 0; i < N; i++) { cin >> x[i] >> y[i]; } for (int i = 0; i < N; i++) { y[i] -= H / 2; } double max_alpha = -M_PI / 2; double min_alpha = M_PI / 2; for (int i = 0; i < N; i++) { double alpha = atan2(y[i], x[i]); max_alpha = max(max_alpha, alpha); min_alpha = min(min_alpha, alpha); } auto [alpha, beta, ans] = search(min_alpha, max_alpha); cout << fixed << setprecision(10) << ans << endl; }