oj.uz

Submission #1098002

# Submission time Handle Problem Language Result Execution time Memory
1098002 2024-10-08T19:28:46 Z 0x34c Mobile (BOI12_mobile) C++17
50 / 100
 1000 ms 117916 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define endl '\n'
#define int ll
#define ld long double
#define pdd pair<ld, ld>

using namespace std;

int dist2(pii a, pii b)
{
    return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second);
}

ld dist(pii a, ld x)
{
    return sqrt((((ld)a.first) - x) * (((ld)a.first) - x) + (ld)(a.second * a.second));
}

const int INF2 = 1e12;
const int INF = 1e9 + 1;
ld eps = 1e-4;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int N, L;
    cin >> N >> L;

    vector<pii> inp(N);
    map<int, int> closest;
    for (int i = 0; i < N; i++)
    {
        int x, y;
        cin >> x >> y;

        inp[i] = {x, y};

        if (!closest.count(x))
            closest[x] = y;
        else
            closest[x] = (abs(closest[x]) > abs(y) ? y : closest[x]);
    }

    vector<pii> pts;
    for (pii p : closest)
        pts.push_back(p);

    N = pts.size();

    auto calc_bp = [&](int idx1, int idx2)
    {
        ld l = -1, r = INF;
        while ((r - l) > eps)
        {
            ld m = l + (r - l) / 2;

            ld d1 = dist(pts[idx1], m), d2 = dist(pts[idx2], m);
            if (d1 < d2)
                l = m;
            else
                r = m;
        }

        return l + (r - l) / 2LL;
    };

    stack<int> stk;
    stk.push(0);
    vector<ld> dists, bps;
    for (int i = 1; i < N; i++)
    {
        ld bp = calc_bp(stk.top(), i);

        while (!bps.empty() && bps.back() > bp)
        {
            bps.pop_back();
            stk.pop();
            dists.pop_back();
            bp = calc_bp(stk.top(), i);
        }

        bps.push_back(bp);
        dists.push_back(dist(pts[i], bp));
        stk.push(i);
    }

    ld mx_dist = 0;
    for (int i = 0; i < bps.size(); i++)
    {
        if (bps[i] < 0 || bps[i] > L)
            continue;
        mx_dist = max(mx_dist, dists[i]);
    }

    ld mn_start = INF2, mn_end = INF2;
    for (int i = 0; i < N; i++)
    {
        mn_start = min(mn_start, dist(pts[i], 0));
        mn_end = min(mn_end, dist(pts[i], L));
    }

    mx_dist = max({mx_dist, mn_start, mn_end});
    cout << setprecision(4) << fixed << mx_dist << endl;
}

Compilation message

mobile.cpp: In function 'int main()':
mobile.cpp:92:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long double>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     for (int i = 0; i < bps.size(); i++)
      |                     ~~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory 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 404 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 604 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 604 KB Output is correct
2 Correct 13 ms 860 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 14 ms 1060 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 600 KB Output is correct
2 Correct 13 ms 860 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 14 ms 984 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1136 KB Output is correct
2 Correct 14 ms 860 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 15 ms 1056 KB Output is correct
5 Correct 2 ms 348 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 8736 KB Output is correct
2 Correct 182 ms 6092 KB Output is correct
3 Correct 148 ms 5840 KB Output is correct
4 Correct 222 ms 8388 KB Output is correct
5 Correct 8 ms 1320 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2144 KB Output is correct
2 Correct 113 ms 4816 KB Output is correct
3 Correct 205 ms 8140 KB Output is correct
4 Correct 245 ms 8656 KB Output is correct
5 Correct 253 ms 9384 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 14272 KB Output is correct
2 Correct 166 ms 6160 KB Output is correct
3 Correct 138 ms 12684 KB Output is correct
4 Correct 294 ms 10336 KB Output is correct
5 Correct 71 ms 3476 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 5688 KB Output is correct
2 Correct 150 ms 5812 KB Output is correct
3 Correct 63 ms 3816 KB Output is correct
4 Correct 294 ms 10440 KB Output is correct
5 Correct 249 ms 9220 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 15044 KB Output is correct
2 Correct 150 ms 5792 KB Output is correct
3 Correct 52 ms 3668 KB Output is correct
4 Correct 301 ms 10328 KB Output is correct
5 Correct 251 ms 9156 KB Output is correct

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 887 ms 70272 KB Output is correct
2 Correct 204 ms 8976 KB Output is correct
3 Correct 174 ms 8964 KB Output is correct
4 Execution timed out 1099 ms 49076 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 9040 KB Output is correct
2 Execution timed out 1068 ms 60996 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 98768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 10324 KB Output is correct
2 Execution timed out 1075 ms 71480 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1060 ms 108408 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 12004 KB Output is correct
2 Execution timed out 1040 ms 86280 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1073 ms 117916 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 13292 KB Output is correct
2 Execution timed out 1043 ms 94736 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1043 ms 117160 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 16468 KB Output is correct
2 Execution timed out 1051 ms 114176 KB Time limit exceeded
3 Halted 0 ms 0 KB -