oj.uz

Submission #1075251

# Submission time Handle Problem Language Result Execution time Memory
1075251 2024-08-25T21:36:23 Z MrPavlito Balloons (CEOI11_bal) C++17
100 / 100
 427 ms 14932 KB 
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 2e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;


long double kvadrat(long double x)
{
    return x*x;
}


long double solve(long double prex, long double prer, long double trx, long double mxr)
{
    long double l = 0;
    long double r = mxr;
    while(r-l>=1e-9)
    {
        long double mid = (l+r)/2;
        if(kvadrat(prex-trx) + kvadrat(prer-mid) < kvadrat(mid+prer))r = mid;
        else l = mid;
    }
    return l;
}

signed main()
{
    ios_base::sync_with_stdio(false),cin.tie(0), cout.tie(0);
    int tt=1;
    //cin >> tt;
    while(tt--)
    {
        int n;
        cin >> n;
        vector<long double> rovi(n);
        vector<long double> xovi(n);
        vector<long double> rez(n, inf);
        for(int i=0; i<n; i++)cin >> xovi[i] >> rovi[i];
        stack<int> stekic;
        for(int i=0; i<n; i++)
        {
            while(!stekic.empty())
            {
                long double prex = xovi[stekic.top()];
                long double prer = rovi[stekic.top()];
                long double trr = solve(prex,prer, xovi[i], rovi[i]);
                rovi[i] = min(rovi[i], trr);
                if(trr >= prer)stekic.pop();
                else break;
            }
            rez[i] = rovi[i];
            stekic.push(i);
        }
        for(int i=0; i<n; i++)cout << fixed << setprecision(3) << rez[i] << endl;

    }
}
/*
3
0 9
8 1
13 7
*/

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 348 KB 505 numbers

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 1668 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 3604 KB 50000 numbers
2 Correct 112 ms 4040 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 6992 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 7812 KB 115362 numbers
2 Correct 253 ms 9044 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 337 ms 10320 KB 154271 numbers
2 Correct 427 ms 14932 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 13140 KB 200000 numbers
2 Correct 425 ms 14932 KB 199945 numbers