제출 #570644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
570644		RandomLB	Balloons (CEOI11_bal)	C++17	30 / 100	2083 ms	1472 KiB

bal

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
template<class T> using indexed_set = tree<T, null_type, less_equal<T>,
        rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order //(k-indexed val with 0-indexing)
#define ook order_of_key //(num of vals in set that are strictly less)
#define ms(x, a) memset(x, a, sizeof(x))
#define siz(x) (int)x.size()
#define len(x) (int)x.length()
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vals, Args&&... values){
    cout << vals << " = ";
    string delim = "";
    (...,(cout << delim << values, delim = ", "));
    cout << endl;
}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9+7;
//===========================================

inline ld lim(ld pp, pair<ld, ld> cir){
    int t = 1000;
    ld l = 0, r = 1e9+5;
    while (t--){
        ld m = (l+r)/2;
        if (sqrt((cir.F-pp)*(cir.F-pp)+(m-cir.S)*(m-cir.S)) >= m+cir.S) l = m;
        else r = m;
    }
    return l;
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    //freopen("test.txt", "r", stdin);
    int n; cin >> n;
    vector<pair<ld, ld>> q;
    for (int i = 1; i <= n; i++){
        ld x, r; cin >> x >> r;
        if (q.empty()){
            q.pb({x, r});
            cout << fixed << setprecision(9) << r << "\n";
            continue;
        }
        while (siz(q) > 1 && lim(x, q[siz(q)-1]) >= lim(x, q[siz(q)-2])) q.pop_back();
        ld res = min(r, lim(x, q[siz(q)-1]));
        cout << fixed << setprecision(9) << res << "\n";
        while (siz(q) && res >= q.back().S) q.pop_back();
        q.push_back({x, res});
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10