제출 #941487

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
941487		quan606303	Balloons (CEOI11_bal)	C++14	30 / 100	147 ms	6704 KiB

bal

///0-0 : what is your motivation, quan606303?
///quan606303 : Hutao
/*idea : 



*/
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define INTMAX INT_MAX
#define INTMIN INT_MIN
#define LONGMAX LLONG_MAX
#define LONGMIN LLONG_MIN
#define fi first
#define se second
#define memfull(a,b) memset(a,b,sizeof(a));
#define endl '\n'
#define file(a) freopen(a".inp","r",stdin); freopen(a".out","w",stdout);
using namespace std;
const int MOD=1e9+7;
const int maxn=200005;
pair<double,double> a[maxn];
int n;
 double ans[maxn];
 double sqr(long double k)
{
    return k*k;
}
 double cal(pair< double, double> x,  double pos)
{
    return sqr(pos-x.fi)/(4*x.se);
}
void solve()
{
    stack<pair< double, double> > st;
    //st.push()
    for (int i=1;i<=n;i++)
    {
         double r=a[i].se;
        while (st.size())
        {
             double cnt=cal(st.top(),a[i].fi);
            r=min(r,cnt);
            if (cnt>=st.top().se)st.pop();
            else break;
        }
        ans[i]=r;
        st.push({a[i].fi,ans[i]});
    }
    for (int i=1;i<=n;i++)cout<<setprecision(3)<<fixed<<ans[i]<<endl;
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //file("");
    cin>>n;
    for (int i=1;i<=n;i++)cin>>a[i].fi>>a[i].se;
    solve();
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10