oj.uz

Submission #1016070

# Submission time Handle Problem Language Result Execution time Memory
1016070 2024-07-07T11:12:59 Z ByeWorld Balloons (CEOI11_bal) C++14
100 / 100
 165 ms 12708 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];
        while(!stac.empty()){
            int idx = stac.back();
            ld nw = dis(idx, i);
            chmn(mn, nw);
            if(r[stac.back()] < mn){
                stac.pop_back(); continue;
            }
            break;
        }
        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 1 ms 2392 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 2 ms 2392 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1112 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3920 KB 50000 numbers
2 Correct 47 ms 2516 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 5728 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 6228 KB 115362 numbers
2 Correct 96 ms 7760 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 6736 KB 154271 numbers
2 Correct 165 ms 12704 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 8276 KB 200000 numbers
2 Correct 165 ms 12708 KB 199945 numbers