oj.uz

Submission #941493

# Submission time Handle Problem Language Result Execution time Memory
941493 2024-03-09T02:24:40 Z dwuy Balloons (CEOI11_bal) C++14
80 / 100
 527 ms 13816 KB 
#include <bits/stdc++.h>

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK "test"
#define int long long
#define double long double

using namespace std;

typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;

const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MX = 200005;

int n;
pdd a[MX];
pdd v[MX];

void nhap(){
    cin >> n;
    for(int i=1; i<=n; i++) cin >> a[i].fi >> a[i].se;
}

double sqr(double x){
    return x*x;
}

double euler(pdd a, pdd b){
    return sqrt(sqr(a.fi - b.fi) + sqr(a.se - b.se));
}

double dis(pdd ball, double p){
    double lo=0, hi=INF;
    for(int t=0; t<50; t++){
        double mid = (lo+hi)/2;
        if(euler(ball, {p, mid}) >= mid + ball.se) lo = mid;
        else hi = mid;
    }
    return (lo + hi)/2;
}

void solve(){   
    stack<pdd> v;
    for(int i=1; i<=n; i++){
        double val = a[i].se;
        while(v.size()){
            val = min({val, dis(v.top(), a[i].fi)});
            if(val >= v.top().se) v.pop();
            else break;
        }
        v.push({a[i].fi, val});
        cout << fixed << setprecision(3) << val << '\n';
    }
}

int32_t main(){
    fastIO;
    //file(TASK);

    nhap();
    solve();

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2396 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 4692 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 5168 KB 50000 numbers
2 Correct 131 ms 4692 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 264 ms 7496 KB 100000 numbers

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 306 ms 8072 KB 97506th numbers differ - expected: '13436.4010000000', found: '13436.3990000000', error = '0.0020000000'
2 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 10064 KB 154271 numbers
2 Correct 524 ms 13816 KB 200000 numbers

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 527 ms 10440 KB 2735th numbers differ - expected: '1883.4630000000', found: '1883.4650000000', error = '0.0020000000'
2 Halted 0 ms 0 KB -