#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
using namespace std;
typedef long double ld;
typedef long double ll;
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;
int sz=0;
for(int i=0;i<n;i++)
{
cin>>x[i]>>r[i];
// for(int&j:q)
for(int j=1;j<=2000 and j<=sz;j++)
{
int k=j;
j=q[sz-j];
ld p=((x[i]-x[j])/sqrtl(4*r[j]));
r[i]=min(r[i],p*p);
j=k;
}
while(q.size()>0 and r[q.back()]+eps<r[i])
{
sz--;
q.pop_back();
}
q.push_back(i);
sz++;
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... |