Submission #693430

#	Time	Username	Problem	Language	Result	Execution time	Memory
693430		yuuCG	Balloons (CEOI11_bal)	C++17	100 / 100	187 ms	7028 KiB

bal

#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define TASK "mincut"
#define ll long long
#define MAXN 1000006
#define pii pair<long long,long long>
#define pdd pair<double, double>
#define ppi pair<ll,pii>
#define ff first
#define ss second
#define pb push_back
#define oo 1e18
using namespace std;
const ll MOD=1e9+7;
bool minimize(ll &a,ll b)
{
    if (a>b)
    {
        a=b;
        return true;
    }
    return false;
}
bool maximize (ll &a,ll b)
{
    if (a<b)
    {
        a=b;
        return true;
    }
    return false;
}
ll n;
void nhap()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n;
}
double calc(pdd x,double y)
{
    return ((x.ff-y)*(x.ff-y))/(4*1.0*x.ss);
}
void solve()
{
  vector<double> ans;
  ans.resize(n+5);
          stack<pdd> check;
    FOR(i,1,n)
    {
        double x,r;
        cin >> x >> r;

        double max_r=r;
        while (!check.empty())
        {
            pdd last=check.top();
            double last_r=calc(last,x);
            max_r=min(max_r,last_r);
            if (max_r>=last.ss)
            {
                check.pop();
                continue;
            }
            else break;
        }
        check.push({x,max_r});
        ans[i]=max_r;
    }
    FOR(i,1,n) cout << fixed << setprecision(3) << ans[i] << '\n';
}
int main()
{
nhap();
solve();
return 0;
}

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