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