제출 #1169128

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1169128		ZeroCool	Balloons (CEOI11_bal)	C++20	100 / 100	109 ms	6988 KiB

bal

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define all(v) v.begin(),v.end()
#define ar array

const int M = 1e6;
const int N = 26e4 + 20;
const int LOG = 31;
const int INF = 1e18;
const int MOD = 1e9 + 7;
const ld EPS = 1e-9;
inline void mm(int &x){x = (x % MOD + MOD) % MOD;}
inline void chmin(int &x, int y){x = min(x, y);}
inline void chmax(int &x, int y){x = max(x, y);}

#pragma GCC optimize("unroll-loops,O3")

int n, x;

int g[N * LOG][2];
int T = 1;

int qry(int x,int u, int i){
    if(i < 0)return 0;
    bool j = (1ll << i) & x;
    if(g[u][j ^ 1])return (1ll << i) | qry(x, g[u][j ^ 1], i - 1);
    else if(g[u][j])return qry(x, g[u][j], i - 1);
    return 0;
}

void ins(int x,int u, int i){
    if(i < 0)return;
    bool j = (1ll << i) & x;
    //cout<<j;
    if(g[u][j])ins(x, g[u][j], i - 1);
    else ins(x, g[u][j] = T++, i - 1);
}

void orz(){
    int n;
    cin>>n;
    int A[n], B[n];
    for(int i= 0;i < n;i++)cin>>A[i]>>B[i];
    stack<ar<ld, 2> > s;
    for(int i = 0;i < n;i++){
        int x = A[i];
        ld mx = B[i];
        while(s.size()){
            auto [y, r] = s.top();
            mx = min(mx, (ld)(x - y) * (x - y) / (4.0 * r));
            if(mx >= r)s.pop();
            else break;
        }
        s.push(ar<ld, 2>{(ld)x, mx});
        cout<<setprecision(12)<<fixed<<mx<<'\n';
    }
}

signed main(){ios_base::sync_with_stdio(false);cin.tie(0);
   
    int t = 1;
    //cin>>t;
    while(t--)orz();
} 

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