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