Submission #403083

#	Time	Username	Problem	Language	Result	Execution time	Memory
403083		ruadhan	Balloons (CEOI11_bal)	C++17	100 / 100	301 ms	11480 KiB

bal

#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;

const int MX = 2e5 + 5;
ll x[MX], radius[MX];
ld ans[MX];

int main()
{
    int N;
    cin >> N;
    for (int i = 0; i < N; i++)
        cin >> x[i] >> radius[i];

    stack<pair<ll, ld>> st;

    for (int i = 0; i < N; i++)
    {
        ld r = radius[i];
        while (!st.empty())
        {
            auto curr = st.top();
            r = min(r, ((curr.first - x[i]) * (curr.first - x[i])) / (4 * curr.second));
            if (r > curr.second)
                st.pop();
            else
                break;
        }
        ans[i] = r;
        st.push({x[i], r});
    }
    cout << fixed << setprecision(3);
    for (int i = 0; i < N; i++)
        cout << ans[i] << "\n";

    return 0;
}

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