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