Submission #1029961

#	Time	Username	Problem	Language	Result	Execution time	Memory
1029961		FatemehSalimi	Balloons (CEOI11_bal)	C++17	0 / 100	143 ms	7708 KiB

bal

//in the neme of god
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 2e5 + 10;
double n, x[MAX_N], r[MAX_N], ans[MAX_N], tmp;
stack <int> st;

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> r[i];
    }
    for (int i = 0; i < n; i++) {
        tmp = 1e9;
        while (st.size() && ((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * ans[st.top()])) < tmp && ((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * ans[st.top()])) < r[i]) {
            tmp = ((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * ans[st.top()]));
            st.pop();
        }
        ans[i] = min(tmp, r[i]);
        st.push(i);
    }
    for (int i = 0; i < n; i++)
        cout << ans[i] << '\n';
}

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