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