oj.uz

답안 #755516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
755516 2023-06-10T08:12:09 Z ZephyrOnFire Balloons (CEOI11_bal) C++17
10 / 100
 233 ms 6512 KB 
#include <vector>
#include <iostream>
#include <stack>
#include <iomanip>

using namespace std;

struct ustruct
{
    long long x;
    long double r;
};

signed main()
{
    long long n;
    cin >> n;

    long long x[n], maxr[n];
    for (long long i = 0; i < n; i++)
    {
        cin >> x[i] >> maxr[i];
    }

    stack<ustruct> st;
    // cout<<__cplusplus<<endl;
    vector<double> ans(n, 0.0);
    for (long long i = 0; i < n; i++)
    {
        if (st.empty())
        {
            st.push({x[i],(long double)maxr[i]});
            ans[i] = maxr[i];
        }
        else
        {
            while (!st.empty())
            {
                long long prevx = st.top().x;
                long double prevr = st.top().r;

                long double curr;
                long double wantr = ((x[i] - prevx + 0.0) * (x[i] - prevx + 0.0)) / (4 * prevr + 0.0);
                if (wantr >= maxr[i])
                {
                    curr = maxr[i];
                }
                else
                {
                    curr = wantr;
                }

                if (curr >= prevr)
                {
                    st.pop();
                    if (st.empty())
                    {
                        st.push({x[i], (long double)maxr[i]});
                        // st.push({x[i], (double)maxr[i]});
                        ans[i] = st.top().r;
                        break;
                    }
                }
                else
                {
                    //
                    st.push({x[i], (long double)(curr)});

                    ans[i] = st.top().r;
                    break;
                }
            }
        }
    }
    cout << fixed << setprecision(3);
    for (auto i : ans)
    {
        cout << i << " ";
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB 10 numbers

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 2nd numbers differ - expected: '252735385.4379999936', found: '1000000000.0000000000', error = '747264614.5620000362'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 6th numbers differ - expected: '213.0000000000', found: '238.0000000000', error = '25.0000000000'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 340 KB 79th numbers differ - expected: '36.0070000000', found: '2766.0000000000', error = '2729.9930000000'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 852 KB 137th numbers differ - expected: '67.1010000000', found: '3129.0000000000', error = '3061.8990000000'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 70 ms 1832 KB 250th numbers differ - expected: '15134.0000000000', found: '18307.0000000000', error = '3173.0000000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 136 ms 3520 KB 162nd numbers differ - expected: '7765.0000000000', found: '14571.0000000000', error = '6806.0000000000'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 175 ms 3928 KB 510th numbers differ - expected: '4505.0010000000', found: '13465.0000000000', error = '8959.9990000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 194 ms 5192 KB 161st numbers differ - expected: '1703.0000000000', found: '4036.0000000000', error = '2333.0000000000'
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 233 ms 6512 KB 248th numbers differ - expected: '2694.0020000000', found: '8658.0000000000', error = '5963.9980000000'
2 Halted 0 ms 0 KB -