#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
using namespace std;
// Model Solution
typedef long double ld;
const int N=2e5+10;
ld x[N],r[N];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
ld eps=1e-10;
vector<int> q;
for(int i=0;i<n;i++)
{
cin>>x[i]>>r[i];
while(q.size()>0)
{
int j=q.back();
ld dif=(x[j]-x[i])*(x[j]-x[i]);
dif/=(r[j]*4);
r[i]=min(r[i],dif);
if(r[j]+eps < r[i])
q.pop_back();
else
break;
}
q.push_back(i);
cout<<fixed<<setprecision(3)<<r[i]<<endl;
}
}
| # | 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... |