제출 #482388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
482388		chungdinh	Balloons (CEOI11_bal)	C++17	100 / 100	565 ms	11204 KiB

bal

#include <cstdio>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <algorithm>
#include <iostream>
#include <cstring>

using namespace std;

#define ll long long
#define ii pair<int, int>
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define all(x) x.begin(), x.end()

const int N = 5e5 + 5;
const ll MOD = 998244353;

int n;
pair<long double, long double> a[N];
long double z[N];

int main() {
    #ifdef CHUNGDINH
    freopen("main.inp","r",stdin);
    #endif // CHUNGDINH

    stack<int> st;

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].first >> a[i].second;

        long double &r = z[i];
        r = a[i].second;

        while (st.size()) {
            int u = st.top();
            r = min(r, (a[i].first - a[u].first) * (a[i].first - a[u].first) / 4 / z[u]);
            if (r >= z[u]) st.pop(); else break;
        }
        st.push(i);

        printf("%.3Lf\n", r);
    }
}

• 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