제출 #714919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
714919		MilosMilutinovic	Balloons (CEOI11_bal)	C++14	20 / 100	963 ms	5452 KiB

bal

#include <bits/stdc++.h>

using i64 = long long;

const double eps = 1E-6;

double solve(double x1, double r, double x2) {
    double low = 0, high = 1.001E9, R = 0;
    while (high - low >= eps) {
        double mid = (low + high) / 2;
        double dist = std::sqrt((long double) (x1 - x2) * (x1 - x2) + (long double) (r - mid) * (r - mid));
        if (dist >= r + mid) {
            R = mid;
            low = mid;
        } else {
            high = mid;
        }
    }
    return R;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n;

    std::vector<double> x(n), r(n);
    for (int i = 0; i < n; i++) {
        std::cin >> x[i] >> r[i];
    }

    std::vector<int> stk;
    for (int i = 0; i < n; i++) {
        double prv = 1.1E9;
        for (int j = stk.size() - 1; j >= 0; j--) {
            double nr = solve(x[stk[j]], r[stk[j]], x[i]);
            if (nr < r[i]) {
                r[i] = nr;
            } else {
                if (prv <= nr) {
                    break;
                }
                prv = nr;
            }
        }
        while (!stk.empty() && r[i] > r[stk.back()]) {
            stk.pop_back();
        }
        stk.push_back(i);
        std::cout << std::fixed << std::setprecision(5) << r[i] << "\n";
    }

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10