oj.uz

답안 #1070644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070644 2024-08-22T16:22:26 Z steveonalex Balloons (CEOI11_bal) C++17
40 / 100
 458 ms 11168 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());
    }

#define double long double

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 sqrtl(sqr(a.first - b.first) + sqr(a.second - b.second));
}
 
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){
        double l = 0, r = radius[i];
        for(int j = 0; j < 70; ++j){
            double mid = (l + r) / 2;
            pair<double, double> p = {x[i], mid};
            bool check = true;
            for(int k: st){
                pair<double, double> cur = {x[k], ans[k]};
                if (distance(cur, p) < ans[k] + mid) check = false;
            }
            if (check) l = mid;
            else r = mid;
        }
        ans[i] = l;

        while(st.size()){
            int k = st.back();
            pair<double, double> p = {x[i], ans[i]};
            pair<double, double> prev = {x[k], ans[k]};
            if (distance(god_point, prev) - ans[k] > distance(god_point, p) - 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB 10 numbers

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB 2 numbers

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB 505 numbers

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 564 KB 114th numbers differ - expected: '39.0180000000', found: '56.0000000000', error = '16.9820000000'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 1616 KB 196th numbers differ - expected: '100.7250000000', found: '111.0000000000', error = '10.2750000000'
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 3212 KB 50000 numbers
2 Correct 131 ms 3240 KB 49912 numbers

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 233 ms 6124 KB 14857th numbers differ - expected: '7169.6020000000', found: '7176.0000000000', error = '6.3980000000'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 266 ms 6964 KB 19035th numbers differ - expected: '80.0830000000', found: '106.0000000000', error = '25.9170000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 350 ms 9040 KB 1734th numbers differ - expected: '1856.0220000000', found: '1865.0000000000', error = '8.9780000000'
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 458 ms 11168 KB 4195th numbers differ - expected: '131.6270000000', found: '148.0000000000', error = '16.3730000000'
2 Halted 0 ms 0 KB -