oj.uz

Submission #1116640

# Submission time Handle Problem Language Result Execution time Memory
1116640 2024-11-22T03:06:36 Z pemguimn Balloons (CEOI11_bal) C++17
100 / 100
 121 ms 9884 KB 
#pragma GCC optimize("O3")

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

int n, x[N], r[N];

long double ans[N];

long double calc(int i, int j){
    long double x1 = x[i], y1 = ans[i];
    long double x2 = x[j];
    return (x1 * x1 + x2 * x2 - 2.0L * x1 * x2 ) / (4.0L * y1);
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> r[i];
        ans[i] = r[i];
    }

    stack<int> st;
    for(int i = 1; i <= n; i++){
        long double reach = r[i];
        while(st.size()){
            reach = min(reach, calc(st.top(), i));
            if(reach < ans[st.top()]) break;
            st.pop();
        }
        ans[i] = reach;
        st.push(i);
    }

    for(int i = 1; i <= n; i++)
        cout << setprecision(9) << fixed << ans[i] << "\n";

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB 10 numbers

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2552 KB 2 numbers

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB 505 numbers

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2384 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5112 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5444 KB 50000 numbers
2 Correct 24 ms 5200 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 6216 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 6404 KB 115362 numbers
2 Correct 62 ms 7580 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 7240 KB 154271 numbers
2 Correct 114 ms 9884 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 7752 KB 200000 numbers
2 Correct 99 ms 9768 KB 199945 numbers