oj.uz

Submission #1016026

# Submission time Handle Problem Language Result Execution time Memory
1016026 2024-07-07T10:01:03 Z ByeWorld Balloons (CEOI11_bal) C++14
20 / 100
 179 ms 10028 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
// #define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)/2)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 2e5+10;
const int MAXA = 1e6+10;
const int INF = 1e9+10;
// const int INF2 = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmn(ld &a, ld b){ a = min(a, b); }
void chmx(ld &a, ld b){ a = max(a, b); }

int n;
int x[MAXN], mx[MAXN];
ld r[MAXN];

ld dis(int j, int i){
    return (ld)(1ll*(x[j]-x[i])*(x[j]-x[i]) / (4*r[j]));
}
signed main(){
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> x[i] >> mx[i];
    }
    vector <int> stac; stac.pb(1);
    r[1] = mx[1];
    for(int i=2; i<=n; i++){
        ld mn = (ld)mx[i];
        if(stac.size() <= 2){
            for(auto j : stac){
                chmn(mn, dis(j, i));
            }
        } else {
            while(stac.size()>=2 && 
                dis(stac[stac.size()-2], i) < dis(stac.back(), i)) stac.pop_back();
            if(stac.size()==1) chmn(mn, dis(stac.back(), i));
            else {
                chmn(mn, dis(stac.back(), i));
                chmn(mn, dis(stac[stac.size()-2], i));
            }
        }
        // for(int j=1; j<=i-1; j++){
        //     ld te = 1ll*(x[j]-x[i])*(x[j]-x[i]) / (4*r[j]);
        //     chmn(mn, te);
        // }
        r[i] = mn; stac.pb(i);
    }
    for(int i=1; i<=n; i++) cout << fixed << setprecision(3) << r[i] << '\n';
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 4th numbers differ - expected: '0.0950000000', found: '3.0000000000', error = '2.9050000000'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB 504th numbers differ - expected: '160.9360000000', found: '163.0000000000', error = '2.0640000000'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 1372 KB 653rd numbers differ - expected: '96.2810000000', found: '123.0000000000', error = '26.7190000000'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 3020 KB 14174th numbers differ - expected: '0.7720000000', found: '1.3710000000', error = '0.5990000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 92 ms 5540 KB 7447th numbers differ - expected: '0.9750000000', found: '8.0000000000', error = '7.0250000000'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 91 ms 6344 KB 4793rd numbers differ - expected: '0.9540000000', found: '10.6220000000', error = '9.6680000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 122 ms 8336 KB 1734th numbers differ - expected: '1856.0220000000', found: '1865.0000000000', error = '8.9780000000'
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 179 ms 10028 KB 2735th numbers differ - expected: '1883.4630000000', found: '1899.0000000000', error = '15.5370000000'
2 Halted 0 ms 0 KB -