# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1266764 | hoangmc2009 | Balloons (CEOI11_bal) | C++17 | 102 ms | 8264 KiB |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using f64 = long double;
i64 n,x[200009],r[200009];
long double y[200009];
vector<int> st;
f64 calc(int i,int j) {return (x[i]-x[j])*(x[i]-x[j])/4.0L/y[i];}
int main()
{
if(fopen("D:/CPP/THEMIS/test.inp","r"))
{
freopen("D:/CPP/THEMIS/test.inp","r",stdin);
freopen("D:/CPP/THEMIS/test.out","w",stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n; cout<<fixed<<setprecision(3);
for(int i=1;i<=n;++i) cin>>x[i]>>r[i];
for(int i=1;i<=n;++i)
{
y[i]=r[i];
while(!st.empty())
{
y[i]=min(y[i],calc(st.back(),i));
if(y[i]>=y[st.back()]) st.pop_back();
else break;
}
cout<<y[i]<<"\n";
st.push_back(i);
}
//for(int i=1;i<st.size();++i) assert(y[st[i-1]]>=y[st[i]]);
}
Compilation message (stderr)
# | 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... |