oj.uz

답안 #1031457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031457 2024-07-22T21:04:21 Z Boas Mobile (BOI12_mobile) C++17
60 / 100
 1000 ms 81052 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 = 4e-4; // 13pt
ld eps = 5e-5; // 13pt
// ld eps = 1e-18; // 4pt: TLE

void solve()
{
    int N;
    ld L;
    cin >> N >> L;
    /*vii points;
    loop(N, i)
    {
        int x, y;
        cin >> x >> y;
        if (!points.empty() && points.back().x == x)
        {
            points.back().y = min(abs(y), abs(points.back().y));
        }
        else
            points.pb({x, y});
    }
    N = points.size();
    vff a;
    for (var[x, y] : points)
        a.pb({x, y});*/
    vff a(N);
    loop(N, i)
    {
        cin >> a[i].x >> a[i].y;
    }
    ld lo = 0.0L, hi = sqrt(1e18L + L * L);
    while (hi - lo > eps)
    {
        ld R = lo + (hi - lo) / 2.0L;
        vff segments;
        loop(N, i)
        {
            auto [x, y] = a[i];
            ld D = (R * R) - ((ld)y * (ld)y);
            if (D >= 0.0L)
            {
                ld l = x - sqrt(D);
                ld r = x + sqrt(D);
                l = max(l, 0.0L);
                r = min(r, L);
                if (l > r)
                    continue;
                while (!segments.empty() && segments.back().x > l)
                {
                    segments.pop_back();
                }
                segments.pb({l, r});
            }
        }
        if (segments.empty())
        {
            lo = R;
            continue;
        }
        // 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;
    }
    ld res = lo + (hi - lo) / 2.0L;
    cout << fixed << setprecision(4) << res << endl;
}

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 772 KB Output is correct
2 Correct 6 ms 776 KB Output is correct
3 Correct 2 ms 548 KB Output is correct
4 Correct 3 ms 784 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1120 KB Output is correct
2 Correct 10 ms 1108 KB Output is correct
3 Correct 8 ms 1092 KB Output is correct
4 Correct 5 ms 1148 KB Output is correct

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1036 KB Output is correct
2 Correct 10 ms 1048 KB Output is correct
3 Correct 8 ms 1036 KB Output is correct
4 Correct 5 ms 1128 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1040 KB Output is correct
2 Correct 10 ms 1056 KB Output is correct
3 Correct 8 ms 1036 KB Output is correct
4 Correct 6 ms 1124 KB Output is correct
5 Correct 7 ms 1208 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 10052 KB Output is correct
2 Correct 111 ms 11352 KB Output is correct
3 Correct 78 ms 6556 KB Output is correct
4 Correct 68 ms 12124 KB Output is correct
5 Correct 65 ms 6116 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 11092 KB Output is correct
2 Correct 83 ms 9640 KB Output is correct
3 Correct 84 ms 10996 KB Output is correct
4 Correct 74 ms 9552 KB Output is correct
5 Correct 67 ms 10472 KB Output is correct

Subtask #9
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 10208 KB Output is correct
2 Correct 118 ms 10504 KB Output is correct
3 Correct 122 ms 10928 KB Output is correct
4 Correct 62 ms 11936 KB Output is correct
5 Correct 103 ms 11188 KB Output is correct

Subtask #10
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 10856 KB Output is correct
2 Correct 147 ms 10836 KB Output is correct
3 Correct 129 ms 12216 KB Output is correct
4 Correct 65 ms 13196 KB Output is correct
5 Correct 109 ms 12116 KB Output is correct

Subtask #11
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 10712 KB Output is correct
2 Correct 147 ms 10860 KB Output is correct
3 Correct 142 ms 11944 KB Output is correct
4 Correct 61 ms 12312 KB Output is correct
5 Correct 113 ms 12936 KB Output is correct

Subtask #12
0 / 5.0

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

Subtask #13
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 647 ms 48248 KB Output is correct
2 Correct 632 ms 54816 KB Output is correct
3 Correct 675 ms 53984 KB Output is correct
4 Correct 325 ms 57500 KB Output is correct
5 Correct 442 ms 55528 KB Output is correct

Subtask #14
0 / 5.0

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

Subtask #15
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 842 ms 68524 KB Output is correct
2 Correct 774 ms 76420 KB Output is correct
3 Correct 904 ms 75472 KB Output is correct
4 Correct 377 ms 63932 KB Output is correct
5 Correct 559 ms 77412 KB Output is correct

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

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

Subtask #21
0 / 5.0

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