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