이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
double dist(const double &x1, const double &y1, const double &x2)
{
double dx = (x2 - x1);
return dx * dx / (4 * y1);
}
void solve()
{
struct elem
{
double x, r;
};
int n;
cin >> n;
vector<elem> a(n);
for (int i = 0; i < n; i++)
cin >> a[i].x >> a[i].r;
vector<double> radii(n);
stack<int> st;
for (int i = 0; i < n; i++)
{
double sz = a[i].r;
while (!st.empty())
{
int u = st.top();
sz = min(sz, dist(a[u].x, radii[u], a[i].x));
if (sz >= radii[u])
st.pop();
else
break;
}
st.emplace(i);
radii[i] = sz;
}
cout << fixed << setprecision(3);
for (int i = 0; i < n; i++)
cout << radii[i] << '\n';
}
int main()
{
ios_base::sync_with_stdio(false), cin.tie(NULL);
solve();
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... |