제출 #548929

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
548929		erto	Balloons (CEOI11_bal)	C++17	0 / 100	309 ms	1512 KiB

bal

#include <bits/stdc++.h>
typedef long long int ll;
#define INF (1e9 + 7)
#define INF2 (998244353)
#define N (ll)1e6+1005
using namespace std;

int n;
long double g, t, h, t1, t2, t3;
long double ans2;
stack<pair<ll, ll>> s;

long double f(long double x, long double y){
    long double t1 = y * y, l=0, r=y, mid, ans = 1e9;
    while(r - l >= 1e-4){
        mid = (r + l) / 2;
        if(t1 + (x - mid) * (x - mid) <= (mid + x) * (mid + x)){
            ans = mid;
            r = mid;
        }
        else{
            l = mid;
        }
    }
    return ans;
}

void solve(){
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> g >> h;
        if(s.empty()){
            s.push({g, h});
            cout << h << "\n";
        }
        else{
            tie(t1, t2) = s.top();
            ans2 = f(t2, (g - t1));
            t = min(h, ans2);
            if(t2 < t){
                s.pop();
                while(!s.empty()){
                    tie(t1, t2) = s.top();
                    ans2 = f(t2, (g - t1));
                    t = min(h, ans2);
                    if(t2 >= t)break;
                    s.pop();
                }
                cout << t << "\n";
                s.push({g, t});
            }
            else{
                cout << t<<'\n';
                s.push({g, t});
            }


        }
    }
}   

int main(){ 
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //cin>>T;
    while (T--){
        solve();
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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