This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |