Submission #874653

# Submission time Handle Problem Language Result Execution time Memory
874653 2023-11-17T13:35:07 Z soyeb_p_jim Balloons (CEOI11_bal) C++14
10 / 100
506 ms 1836 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_pair_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_statistics_node_update>
void solve()
{
    ll n;
    cin >> n;
    stack<pair<ld, ld>> st;
    for (int i = 0; i < n; i++)
    {
        ld pos, r;
        cin >> pos >> r;
        ld red = r;
        if (st.size() == 0)
        {
            st.push({pos, red});
            printf("%.3Lf\n", red);
        }
        else
        {
            bool ck = 0;
            ld mn = r;
            while (st.size())
            {
                ld a = st.top().second;
                ld d = pos - st.top().first;
                ld rr = (d * d) / (4 * a);
                mn = min(mn, rr);
                if (rr < a)
                {
                    printf("%.3Lf\n", mn);
                    st.push({pos, mn});
                    ck = 1;
                    break;
                }
                else
                {
                    st.pop();
                }
                //cout << mn << " " << d << " " << a << "\n";
            }
            if (!ck)
            {
                st.push({pos, red});
                printf("%.3Lf\n", red);
            }
        }
    }
}
int main()
{
    //ios::sync_with_stdio(false);
    //cin.tie(nullptr);
    solve();
    return 0;
}
/*
    d^2 + (r-x)^2 = (r+x)^2
    d^2 / 4r = x
*/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB 10 numbers
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 2nd numbers differ - expected: '252735385.4379999936', found: '1000000000.0000000000', error = '747264614.5620000362'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 500 KB 6th numbers differ - expected: '213.0000000000', found: '238.0000000000', error = '25.0000000000'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 348 KB 79th numbers differ - expected: '36.0070000000', found: '2766.0000000000', error = '2729.9930000000'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 488 KB 137th numbers differ - expected: '67.1010000000', found: '3129.0000000000', error = '3061.8990000000'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 135 ms 788 KB 250th numbers differ - expected: '15134.0000000000', found: '18307.0000000000', error = '3173.0000000000'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 252 ms 1276 KB 162nd numbers differ - expected: '7765.0000000000', found: '14571.0000000000', error = '6806.0000000000'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 298 ms 1380 KB 510th numbers differ - expected: '4505.0010000000', found: '13465.0000000000', error = '8959.9990000000'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 423 ms 1836 KB 161st numbers differ - expected: '1703.0000000000', found: '4036.0000000000', error = '2333.0000000000'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 506 ms 1832 KB 248th numbers differ - expected: '2694.0020000000', found: '8658.0000000000', error = '5963.9980000000'
2 Halted 0 ms 0 KB -