oj.uz

Submission #1016047

# Submission time Handle Problem Language Result Execution time Memory
1016047 2024-07-07T10:15:23 Z ByeWorld Balloons (CEOI11_bal) C++14
50 / 100
 2000 ms 4800 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)((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));
            // }
            int idx = -1;
            for(auto j : stac){
                if(mn > dis(j, i)) idx = j;
                chmn(mn, dis(j, i));
            }
            if(idx != -1){
                while(stac.back() != idx) stac.pop_back();
            }
        }
        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
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 8 ms 348 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 466 ms 1360 KB 20000 numbers

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2040 ms 2244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2039 ms 3224 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2069 ms 3280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2024 ms 3896 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 4800 KB Time limit exceeded
2 Halted 0 ms 0 KB -