oj.uz

답안 #548931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548931 2022-04-14T18:53:19 Z erto Balloons (CEOI11_bal) C++17
0 / 100
 315 ms 1520 KB 
#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(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.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB 8th numbers differ - expected: '8.7410000000', found: '9.0909600000', error = '0.3499600000'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB 1st numbers differ - expected: '247294217.0000000000', found: '247294000.0000000000', error = '217.0000000000'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 13th numbers differ - expected: '2.3960000000', found: '2.4500400000', error = '0.0540400000'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 340 KB 3rd numbers differ - expected: '121.0000000000', found: '121.0020000000', error = '0.0020000000'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 444 KB 35th numbers differ - expected: '174.0000000000', found: '174.0020000000', error = '0.0020000000'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 83 ms 800 KB 251st numbers differ - expected: '15123.0020000000', found: '15123.0000000000', error = '0.0020000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 184 ms 1004 KB 285th numbers differ - expected: '7629.0020000000', found: '7629.0000000000', error = '0.0020000000'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 193 ms 1040 KB 511th numbers differ - expected: '4494.0050000000', found: '4494.0100000000', error = '0.0050000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 254 ms 1144 KB 164th numbers differ - expected: '1698.0020000000', found: '1698.0000000000', error = '0.0020000000'
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 315 ms 1520 KB 248th numbers differ - expected: '2694.0020000000', found: '2694.0000000000', error = '0.0020000000'
2 Halted 0 ms 0 KB -