oj.uz

답안 #1031359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031359 2024-07-22T18:32:38 Z Boas Mobile (BOI12_mobile) C++17
4 / 100
 1000 ms 81940 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

template <typename T1, typename T2>
using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using indexed_set = indexed_map<T, null_type>;

#define loop(x, i) for (int i = 0; i < (x); i++)
#define loop1(x, i) for (int i = 1; i <= (x); i++)
#define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--)
#define itloop(x) for (auto it = begin(x); x != end(x); it++)
#define itrev(x) for (auto it = rbegin(x); x != rend(x); it++)
#define int long long
#define INF ((int64_t)(4e18 + 1))
#define INF32 ((int32_t)(2e9 + 1))
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define existsIn(x, l) (count(ALL(l), x) > 0)
#define removeIn(x, l) l.erase(find(ALL(l), x))
#define pb push_back
#define sz(x) (int)(x).size()
#define x first
#define y second
#define var const auto &
#define foreach(l) for (var e : l)

typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vii> vvii;
typedef vector<viii> vviii;
typedef set<int> si;
typedef set<ii> sii;
typedef set<iii> siii;
typedef vector<si> vsi;
typedef vector<sii> vsii;
typedef vector<vsi> vvsi;
typedef vector<string> vstr;
typedef vector<vector<string>> vvstr;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vi::iterator viit;
typedef si::iterator siit;
typedef int8_t in8;
typedef int16_t in16;
typedef int32_t in32;
typedef int64_t in64;

typedef long double ld;
typedef vector<pair<ld, ld>> vff;
ld eps = 1e-5;

void solve()
{
    int N, L;
    cin >> N >> L;
    vii a(N);
    loop(N, i)
    {
        cin >> a[i].x >> a[i].y;
    }
    ld lo = 0, hi = 1e9;
    while (hi - lo > eps)
    {
        ld R = lo + (hi - lo) / 2;
        vff segments;
        loop(N, i)
        {
            auto [x, y] = a[i];
            ld D = R * R - (ld)y * y;
            if (D >= 0)
            {
                ld l = x - sqrt(D);
                ld r = x + sqrt(D);
                segments.pb({l, r});
            }
        }
        sort(ALL(segments));
        bool highwayCovered = 1;
        ld l = segments[0].first, r = segments[0].second;
        if (l > 0)
            highwayCovered = 0;
        else
        {
            for (auto [l_i, r_i] : segments)
            {
                if (l_i > r)
                {
                    highwayCovered = 0;
                    break;
                }
                r = max(r, r_i);
            }
        }
        if (r < L)
            highwayCovered = 0;
        if (highwayCovered)
        {
            hi = R;
        }
        else
            lo = R;
    }
    cout << fixed << setprecision(5) << lo << endl;
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    solve();
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 736 KB Output is correct
2 Runtime error 6 ms 808 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 984 KB Output is correct
2 Correct 23 ms 1016 KB Output is correct
3 Correct 36 ms 980 KB Output is correct
4 Correct 9 ms 1012 KB Output is correct

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 10 ms 1076 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 156 ms 8888 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 217 ms 9000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 398 ms 9736 KB Output is correct
2 Correct 512 ms 9620 KB Output is correct
3 Correct 673 ms 9532 KB Output is correct
4 Incorrect 85 ms 11180 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 505 ms 10892 KB Output is correct
2 Correct 720 ms 10728 KB Output is correct
3 Correct 864 ms 10328 KB Output is correct
4 Correct 83 ms 11152 KB Output is correct
5 Incorrect 226 ms 10532 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 10816 KB Output is correct
2 Correct 588 ms 10692 KB Output is correct
3 Correct 768 ms 10364 KB Output is correct
4 Incorrect 89 ms 11216 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1064 ms 44804 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1051 ms 48596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1025 ms 64404 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1027 ms 69020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1024 ms 66752 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1048 ms 72488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1031 ms 69200 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1045 ms 75424 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1060 ms 74100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1051 ms 81940 KB Time limit exceeded
2 Halted 0 ms 0 KB -