이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
stack< pair<long double, long double> > st;
int main()
{
ios_base::sync_with_stdio(false), cin.tie(0),
cout.tie(0);
cout<< fixed << setprecision(10);
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
long double x, r;
cin>> x >> r;
while(!st.empty())
{
long double d = st.top().first - x;
r = min(r, d * d / 4 / st.top().second);
if (r > st.top().second)
st.pop();
else
break;
}
st.push(make_pair(x, r));
cout << r << 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... |