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