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