oj.uz

답안 #872452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872452 2023-11-13T06:44:22 Z sleepntsheep Balloons (CEOI11_bal) C++17
20 / 100
 301 ms 6480 KB 
#include <iostream>
#include <iomanip> 
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 200005

int n, x[N], r[N];
f80 rr[N];

int main()
{
    ShinLena;
    cin >> n;
    for (int i = 0; i < n; ++i) cin >> x[i] >> r[i];

    rr[0] = r[0];
    for (int st = 0, i = 1; i < n; ++i)
    {
        f80 l = 0, r = ::r[i], iter = 50;
        for (; iter--;)
        {
            f80 m = (l+r)/2, ok = 1;
            for (int j = i-1; ok && j >= st; --j)
            {
                f80 A = 1L * x[i] * x[i] + 1L * x[j] * x[j] - 2L * x[i] * x[j] - 4L * rr[j] * m;
                if (A < 0) ok = 0;
            }
            if (ok) l = m;
            else r = m;
        }

        rr[i] = l;
        if (rr[i] >= ::rr[i-1]) st = i;
    }

    cout << fixed << setprecision(3);
    for (int i = 0; i < n; ++i)
        cout << rr[i] << '\n';

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB 4th numbers differ - expected: '0.0950000000', found: '3.0000000000', error = '2.9050000000'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 2396 KB 504th numbers differ - expected: '160.9360000000', found: '163.0000000000', error = '2.0640000000'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 4700 KB 653rd numbers differ - expected: '96.2810000000', found: '123.0000000000', error = '26.7190000000'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 86 ms 4980 KB 13946th numbers differ - expected: '0.0440000000', found: '2215.6580000000', error = '2215.6140000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 166 ms 5456 KB 7237th numbers differ - expected: '0.0220000000', found: '7.0000000000', error = '6.9780000000'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 193 ms 5572 KB 4646th numbers differ - expected: '0.0870000000', found: '8.0000000000', error = '7.9130000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 272 ms 6092 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 301 ms 6480 KB 2723rd numbers differ - expected: '859.0470000000', found: '862.0000000000', error = '2.9530000000'
2 Halted 0 ms 0 KB -