제출 #1266713

#제출 시각아이디문제언어결과실행 시간메모리
1266713bach25089Balloons (CEOI11_bal)C++20
10 / 100
85 ms9796 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<long long> a(n);
    vector<long double> l(n);
    for (int i = 0; i < n; ++i)
    {
        long long x, r;
        cin >> x >> r;
        a[i] = x;
        l[i] = (long double)r;
    }
    vector<long double> r(n, 0.0L);
    vector<int> st;
    st.reserve(n);
    for (int i = 0; i < n; ++i)
    {
        r[i] = l[i];
        while (!st.empty())
        {
            int j = st.back();
            long double dx = (long double)(a[i] - a[j]);
            long double p = (dx * dx) / (4.0L * r[j]);
            if (p > l[i]) p = l[i];
            if (p >= r[j])
            {
                st.pop_back();
                continue;
            }
            else
            {
                r[i] = p;
                break;
            }
        }
        st.push_back(i);
    }
    for (int i = 0; i < n; ++i)
    {
        cout << fixed << setprecision(3) << (double)r[i] << "\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...