oj.uz

Submission #1070680

# Submission time Handle Problem Language Result Execution time Memory
1070680 2024-08-22T16:45:53 Z steveonalex Balloons (CEOI11_bal) C++17
100 / 100
 675 ms 8532 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
pair<double, double> god_point = {2e9, 2e9};
 
double sqr(double x){return x * x;}
double distance(pair<double, double> a, pair<double, double> b){
    return sqrt(sqr(a.first - b.first) + sqr(a.second - b.second));
}

double get_min_radius(double dis, double r1){
    return sqr(dis) / r1 / 4;
}
 
int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();
 
    int n; cin >> n;
    vector<int> x(n), radius(n);
    for(int i = 0; i<n; ++i) cin >> x[i] >> radius[i]; 
 
    vector<double> ans(n);
    cout << fixed << setprecision(3);
 
    vector<int> st;
    for(int i = 0; i<n; ++i){
        ans[i] = radius[i];
        for(int j: st){
            minimize(ans[i], get_min_radius(x[i] - x[j], ans[j]));
        }
 
        while(st.size()){
            int j = st.back();
            if (get_min_radius(god_point.first - x[j], ans[j]) > get_min_radius(god_point.first - x[i], ans[i])) st.pop_back();
            else break; 
        }
        st.push_back(i);
    }
 
    printArr(ans, "\n");
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    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 1 ms 348 KB 2 numbers

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1044 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 2132 KB 50000 numbers
2 Correct 135 ms 2644 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 3664 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 634 ms 4156 KB 115362 numbers
2 Correct 364 ms 5424 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 675 ms 5456 KB 154271 numbers
2 Correct 566 ms 8468 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 6688 KB 200000 numbers
2 Correct 550 ms 8532 KB 199945 numbers