이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
double maxr(double x, double r2){
return x * x / (4 * r2);
}
int main() {
int n;
cin >> n;
stack<pair<double, double>> stk;
for(int i = 0; i < n; i++){
double x, rad, keep;
cin >> x >> rad;
keep = rad;
while(!stk.empty()){
pair<double, double> curr = stk.top();
double new_r = maxr(x - curr.first, curr.second);
keep = min(keep, new_r);
if(curr.second <= keep) {
stk.pop();
continue;
}
else break;
}
cout << fixed << setprecision(3) << keep << '\n';
stk.push(make_pair(x, keep));
}
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... |