Submission #433143

#	Time	Username	Problem	Language	Result	Execution time	Memory
433143		jli12345	Balloons (CEOI11_bal)	C++14	100 / 100	209 ms	10892 KiB

bal

#include <bits/stdc++.h>
using namespace std;

int N;
pair<long long, double> arr[200100];

double ans[200100];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> N;
    for (int i = 1; i <= N; i++){
        cin >> arr[i].first >> arr[i].second;
    }
    stack<int> s;
    for (int i = 1; i <= N; i++){
        double rad = arr[i].second;
        while (!s.empty()){
            rad = min(rad, pow((arr[i].first-arr[s.top()].first), 2)/(4*ans[s.top()]));
            rad = min(rad, arr[i].second);
            if (rad > ans[s.top()])
                s.pop();
            else
                break;
        }
        s.push(i);
        ans[i] = rad;
    }
    for (int i = 1; i <= N; i++){
        cout << fixed << setprecision(5) << ans[i] << "\n";
    }
}

• 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