Submission #872165

#	Time	Username	Problem	Language	Result	Execution time	Memory
872165		12345678	Balloons (CEOI11_bal)	C++17	10 / 100	2 ms	604 KiB

bal

#include <bits/stdc++.h>

using namespace std;

const int nx=2e3+5;
double n, x[nx], dp[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>x[i]>>dp[i];
    stack<pair<int, double>> s;
    for (int i=1; i<=n; i++)
    {
        while (!s.empty())
        {
            dp[i]=min(dp[i], (((x[i]-x[s.top().first])*(x[i]-x[s.top().first]))/(4*dp[s.top().first])));
            if (dp[i]<=s.top().second) s.pop();
            else break;
        }
        printf("%.3f\n", dp[i]);
        s.push({i, dp[i]});
    }
}

• 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