oj.uz

Submission #1095831

# Submission time Handle Problem Language Result Execution time Memory
1095831 2024-10-03T09:26:20 Z Omar_Elgedawy Balloons (CEOI11_bal) C++17
100 / 100
 130 ms 8688 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define ld long double
#define F first
#define S second
#define el '\n'
#define cout(x) for(auto v:x)cout<<v<<el
#define coutp(x) for(auto v:x)cout<<v.F<<' '<<v.S<<el
#define cin(x) for(auto &v:x)cin>>v;
#define pb(x) push_back(x)
#define all(x)  x.begin(),x.end()

const int N = 5e3 + 5, M = 1e2 + 5, Mod = 1e9 + 7;
int dx[8] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[8] = {0, 0, 1, -1, 1, -1, -1, 1};

int nxt()
{
    int x;
    cin >> x;
    return x;
}
ld calc(ld a,pair<ld,ld>b)
{
    return (a-b.F)*(a-b.F)/(4*b.S);
}
void solve(int h)
{
    int n;
    cin>>n;
    stack<pair<ld,ld>>st;
    vector<ld>ans;
    for(int i=0;i<n;i++)
    {
        ld x,r;
        cin>>x>>r;
        while(st.size())
        {
            auto t=st.top();
            r=min(r,calc(x,t));
            if(r>=t.S)st.pop();
            else break;
        }
        st.emplace(x,r);
        ans.push_back(r);
    }
    cout<<fixed<<setprecision(3);
    cout(ans);
}

int32_t main()
{
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r" , stdin);
    // freopen("output.txt", "w", stdout);
    // freopen("feast.in", "r", stdin);
    // freopen("feast.out", "w", stdout);
    // #endif
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tc = 1;
    // cin >> tc;
    for (int i = 1; i <= tc; i++)solve(i);
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB 10 numbers

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB 2 numbers

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB 505 numbers

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1256 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2760 KB 50000 numbers
2 Correct 31 ms 2584 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 4616 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 5280 KB 115362 numbers
2 Correct 71 ms 5376 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 6764 KB 154271 numbers
2 Correct 129 ms 8664 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 7932 KB 200000 numbers
2 Correct 130 ms 8688 KB 199945 numbers