#include #include #include #include #include #include #include using ld = long double; constexpr ld PI = 3.1415926535897932384626433832795028; #define show(x) std::cerr << #x << " = " << (x) << std::endl template std::ostream& operator<<(std::ostream& os, const std::vector& v) { os << "["; for (const auto& p : v) { os << p << ","; } return (os << "]\n"); } int main() { int N, L; std::cin >> N >> L; std::vector l(N + 1); for (auto& e : l) { std::cin >> e; } if (L > std::accumulate(l.begin(), l.end(), 0)) { for (int i = 0; i < N; i++) { std::cout << 0 << std::endl; } return 0; } auto sect = [&](int l, int r) -> ld { if (l > r) { std::swap(l, r); } if (L <= r - l) { return l * l * PI; } if (l + r <= L) { return 0; } const ld s1 = std::acos((ld)(L * L + l * l - r * r) / (2 * l * L)); const ld s2 = std::acos((ld)(L * L - l * l + r * r) / (2 * r * L)); return l * l * s1 + r * r * s2 - L * l * std::sin(s1); }; auto area = [&](const int lmin, const int lmax, const int rmin, const int rmax) { return sect(lmax, rmax) - sect(lmax, rmin) - sect(lmin, rmax) + sect(lmin, rmin); }; constexpr int MAX = 1000; auto update = [](const int min, const int max, const int d) -> std::pair { if (min >= d) { return {min - d, max + d}; } if (max >= d) { return {0, max + d}; } return {d - max, max + d}; }; std::vector lmin(N, MAX), lmax(N, 0), rmin(N, MAX), rmax(N, 0); for (int i = 0; i < N; i++) { const int L = l[i], R = l[N - i]; const int lmi = (i == 0 ? 0 : lmin[i - 1]), lma = (i == 0 ? 0 : lmax[i - 1]); const auto ln = update(lmi, lma, L); lmin[i] = ln.first, lmax[i] = ln.second; const int rmi = (i == 0 ? 0 : rmin[N - i]), rma = (i == 0 ? 0 : rmax[N - i]); const auto rn = update(rmi, rma, R); rmin[N - i - 1] = rn.first, rmax[N - i - 1] = rn.second; } // show(lmin), show(lmax), show(rmin), show(rmax); for (int i = 0; i < N; i++) { std::cout << std::fixed << std::setprecision(15) << area(lmin[i], lmax[i], rmin[i], rmax[i]) << std::endl; } return 0; }