oj.uz

Submission #952393

# Submission time Handle Problem Language Result Execution time Memory
952393 2024-03-23T17:22:34 Z veljko Balloons (CEOI11_bal) C++17
100 / 100
 204 ms 15588 KB 
/*****from dust I have come, dust I will be*****/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define double long double
#define forn(i,n) for(int i=0;i<n;i++)
int dx[8] = { 1, 0, -1, 0, -1, 1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, -1, 1, 1, -1 };
int ceil_div(int a, int b) {return a % b == 0 ? a / b : a / b + 1;}
 
const int MOD = 1000000007;
//const int MOD = 998244353;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key
 
/*
int k = A.order_of_key(p[i].second);
A.erase(A.find_by_order(k));
erase element from pbds multiset
*/

double r(double x1, double r1, double x2) {
	x1 = x1 - x2;
	x1 = x1 * x1;
	x1 = x1 / (4.0 * r1);
	return x1;
}

void solve(){
    int n; cin >> n;
    vector<pair<double, double>>a(n);
    for (auto &t : a) cin >> t.first>>t.second;
    vector<double>ans;
    ans.push_back(a[0].second);
    stack<pair<double, double>>stek;
    stek.push({a[0].first, a[0].second});
    for (int i=1;i<n;i++){
        double mn = a[i].second;
        while (!stek.empty()){
            auto t = stek.top();
            mn = min(mn, r(t.first, t.second, a[i].first));
            if (t.second <= mn) stek.pop();
            else break;
        }
        ans.push_back(mn);
        stek.push({a[i].first, mn});
    }
    for (auto t : ans){
        cout << fixed <<setprecision(3);
        cout <<t<<'\n';
    }
}
 
 
int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 

 
    int t = 1; //cin >>t;
    for (int i=1;i<=t;i++){
        solve();
    }
    return 0;
}

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1512 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 3528 KB 50000 numbers
2 Correct 43 ms 3248 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 6060 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 6988 KB 115362 numbers
2 Correct 91 ms 9300 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 9536 KB 154271 numbers
2 Correct 149 ms 15176 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 11600 KB 200000 numbers
2 Correct 154 ms 15588 KB 199945 numbers