Submission #483474

#	Time	Username	Problem	Language	Result	Execution time	Memory
483474		Shin	Balloons (CEOI11_bal)	C++14	20 / 100	182 ms	6840 KiB

bal

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(), x.end()

using namespace std;
const int N = 2e5 + 7;
const int MOD = 1e9 + 7; // 998244353;
const int INF = 1e9 + 7;
const long long INFLL = 1e18 + 7;

template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

#define SQR(x) (x) * (x)

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

void solve(void) {
    cin >> n;
    for (int i = 1; i <= n; i ++) {
        int l, r; cin >> l >> r;
        a[i] = mp(l, r * 1.0);
    }

    stack<pair<int, double>> st;
    st.push(a[1]);
    for (int i = 2; i <= n; i ++) {
        while (!st.empty()) {
            pair<int, double> pre = st.top();
            minimize(a[i].se, SQR(pre.fi - a[i].fi) / (4.0 * pre.se));
            if (a[i].se < pre.se) break;
            st.pop();
        }
        st.push(a[i]);
    }

    for (int i = 1; i <= n; i ++) {
        cout << fixed << setprecision(3) << a[i].se << '\n';
    }
}

int main(void) {
    cin.tie(0)->sync_with_stdio(0); 
    int test = 1;
    // cin >> test;
    while (test --) {
        solve();
    }
    return 0;
}

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