#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pll pair<int, int>
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define endl '\n'
#define ld long double
signed main(){
int n;cin>>n;
vector<ld> x(n);
vector<ld> y(n), lim(n);
for(int i=0;i<n;i++)cin>>x[i]>>lim[i];
set<pair<ld, int>> st; // {y[i], i}
priority_queue<pair<ld, int>,vector<pair<ld,int>>,greater<pair<ld,int>>> pq; // {life, i}
for(int i=0;i<n;i++){
y[i]=lim[i];
for(int j=0;j<i;j++){
ld py=y[j];
int pi=j;
ld cand=(x[i]-x[pi])/(2*sqrt(py));
cand=cand*cand;
y[i]=min(y[i], cand);
}
}
cout<<fixed<<setprecision(6);
for(int i=0;i<n;i++){
cout<<y[i]<<" ";
}
}
| # | 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... |