Submission #590232

# Submission time Handle Problem Language Result Execution time Memory
590232 2022-07-05T16:49:06 Z Minhho Balloons (CEOI11_bal) C++17
100 / 100
210 ms 14852 KB
#define taskname "1"
#include<bits/stdc++.h>
#define db long double

using namespace std;
const int maxn = 2e5 + 10;
const db eps = 1e-9;
int n;
db ans[maxn], x[maxn], r[maxn];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>n;
    stack<int> st;
    for (int i=1; i<=n; i++)
    {
        cin>>x[i]>>r[i];
        while (!st.empty())
        {
            db x1 = x[st.top()], r1 = ans[st.top()];
            r[i] = min(r[i], (x[i]-x1)*(x[i]-x1)/(4.0*r1));
            if (r[i] >= r1) st.pop();
            else break;
        }
        ans[i] = r[i];
        st.emplace(i);
    }
    for (int i=1; i<=n; i++) cout<<setprecision(3)<<fixed<<ans[i]<<"\n";
}
/**
3
0 9
8 1
13 7
**/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB 10 numbers
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB 2 numbers
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB 505 numbers
# Verdict Execution time Memory Grader output
1 Correct 4 ms 468 KB 2000 numbers
# Verdict Execution time Memory Grader output
1 Correct 24 ms 1560 KB 20000 numbers
# Verdict Execution time Memory Grader output
1 Correct 56 ms 3804 KB 50000 numbers
2 Correct 49 ms 3968 KB 49912 numbers
# Verdict Execution time Memory Grader output
1 Correct 115 ms 6696 KB 100000 numbers
# Verdict Execution time Memory Grader output
1 Correct 122 ms 7608 KB 115362 numbers
2 Correct 117 ms 8972 KB 119971 numbers
# Verdict Execution time Memory Grader output
1 Correct 175 ms 10032 KB 154271 numbers
2 Correct 190 ms 14852 KB 200000 numbers
# Verdict Execution time Memory Grader output
1 Correct 210 ms 12800 KB 200000 numbers
2 Correct 208 ms 14760 KB 199945 numbers