제출 #628403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
628403		shubham20_03	Balloons (CEOI11_bal)	C++17	30 / 100	176 ms	9164 KiB

bal

#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define deb(x) cout<<#x<<'='<<x<<'\n';
#define deb2(x,y) cout<<#x<<'='<<x<<", "<<#y<<'='<<y<<'\n';
#define int long long
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define ld long double
const long double PI = acos(-1);
const int mod = 1e9 + 7, inf = 1e18;
const int D = 2e5 + 10;

signed main() {
    fastio

    // freopen("../input1.txt", "r", stdin);
    // freopen("../output1.txt", "w", stdout);

    int n; cin >> n;
    int x[n], r[n];
    for (int i = 0; i < n; i++)
        cin >> x[i] >> r[i];

    ld ans[n];

    auto get_r = [&](int p, int q) {
        return (x[q] - x[p]) * (x[q] - x[p]) / (4.0 * ans[p]);
    };

    stack<int> stk;
    for (int i = 0; i < n; i++) {
        ans[i] = r[i];
        while (stk.size()) {
            ld cr = get_r(stk.top(), i);
            ans[i] = min(ans[i], cr);
            if (cr >= ans[stk.top()])
                stk.pop();
            else break;
        }
        stk.push(i);
    }

    for (int i = 0; i < n; i++)
        cout << setprecision(13) << ans[i] << '\n';

    return 0;
}

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