Submission #443116

#	Time	Username	Problem	Language	Result	Execution time	Memory
443116		prvocislo	Balloons (CEOI11_bal)	C++17	10 / 100	257 ms	8124 KiB

bal

// aww geometria !! :)
#include <bits/stdc++.h>
typedef long double ld;
using namespace std;

ld maxr(ld x1, ld r1, ld x2)
{
    ld x = r1, z = x2 - x1;
    return (z * z) / (4. * x);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); 
    cout << fixed << setprecision(3);
    int n;
    cin >> n;
    vector<ld> x(n), r(n);
    vector<int> st;
    for (int i = 0; i < n; i++)
    {
        cin >> x[i] >> r[i];
        while (st.size() > 1 && maxr(x[st.back()], r[st.back()], x[i]) > maxr(x[st[st.size() - 2]], r[st[st.size() - 2]], x[i]))
            st.pop_back();
        while (!st.empty() && r[st.back()] < r[i])
             r[i] = min(r[i], maxr(x[st.back()], r[st.back()], x[i])), st.pop_back();
        if (!st.empty()) r[i] = min(r[i], maxr(x[st.back()], r[st.back()], x[i]));
        st.push_back(i);
    }
    for (int i = 0; i < n; i++) cout << r[i] << "\n";
    return 0;
}

• Subtask 1: 0 / 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