Submission #872452

#	Time	Username	Problem	Language	Result	Execution time	Memory
872452		sleepntsheep	Balloons (CEOI11_bal)	C++17	20 / 100	301 ms	6480 KiB

bal

#include <iostream>
#include <iomanip> 
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 200005

int n, x[N], r[N];
f80 rr[N];

int main()
{
    ShinLena;
    cin >> n;
    for (int i = 0; i < n; ++i) cin >> x[i] >> r[i];

    rr[0] = r[0];
    for (int st = 0, i = 1; i < n; ++i)
    {
        f80 l = 0, r = ::r[i], iter = 50;
        for (; iter--;)
        {
            f80 m = (l+r)/2, ok = 1;
            for (int j = i-1; ok && j >= st; --j)
            {
                f80 A = 1L * x[i] * x[i] + 1L * x[j] * x[j] - 2L * x[i] * x[j] - 4L * rr[j] * m;
                if (A < 0) ok = 0;
            }
            if (ok) l = m;
            else r = m;
        }

        rr[i] = l;
        if (rr[i] >= ::rr[i-1]) st = i;
    }

    cout << fixed << setprecision(3);
    for (int i = 0; i < n; ++i)
        cout << rr[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