#include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define ll long long
#define all(a) a.begin(),a.end()
#define eb push_back
int i,n,t;
const ll li = 1000;
ll x,y,xx,yy;
stack<pair<ll,ll>> st;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
cout<<setprecision(3)<<fixed;
for(i = 1;i<=n;i++)
{
cin>>x>>y;
y *= li;
while(st.size())
{
xx = st.top().fi;
yy = st.top().se;
y = min(y,(x - xx) * (x - xx) * li * li / yy / 4);
if(y >= yy)
{
st.pop();
}
else break;
}
st.push(make_pair(x,y));
cout<<(double)y / li<<'\n';
}
return 0;
}
# | 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... |