이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//in the neme of god
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 10;
float n, x[MAX_N], r[MAX_N], ans[MAX_N], tmp;
stack <int> st;
int main(){
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> r[i];
}
for (int i = 0; i < n; i++) {
tmp = 1e9;
while (st.size() && ((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * r[st.top()])) < tmp &&((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * r[st.top()])) < r[i]) {
tmp = ((x[i] - x[st.top()]) * (x[i] - x[st.top()]) / (4 * r[st.top()]));
st.pop();
}
ans[i] = min(tmp, r[i]);
st.push(i);
}
for (int i = 0; i < n; i++)
cout << ans[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... |