oj.uz

Submission #873844

# Submission time Handle Problem Language Result Execution time Memory
873844 2023-11-16T00:36:33 Z tvladm2009 Mobile (BOI12_mobile) C++17
12 / 100
 233 ms 16468 KB 
#include <bits/stdc++.h>

using i64 = long long;
using ld = long double;

ld cross(std::pair<int, int> a, std::pair<int, int> b) {
    int x1 = a.first, x2 = b.first, y1 = a.second, y2 = b.second;
    return 1.0 * (1ll * x2 * x2 + y2 * y2 - 1ll * x1 * x1 - 1ll * y1 * y1) / (2.0 * (x2 - x1));
}

ld solve(ld s, ld e, std::pair<int, int> t) {
    return std::max(std::hypot(s - t.first, t.second), std::hypot(e - t.first, t.second));
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cout << std::fixed << std::setprecision(10);

    int n, L;
    std::cin >> n >> L;
    std::vector<std::pair<int, int>> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i].first >> a[i].second;
        a[i].second = std::abs(a[i].second);
    }
    std::sort(a.begin(), a.end());
    std::deque<std::pair<int, int>> st;
    for (int i = 0; i < n; i++) {
        int j = i;
        while (j < n && a[j].first == a[i].first) {
            j++;
        }
        while (st.size() >= 2 && cross(st[st.size() - 2], st.back()) > cross(st.back(), a[i])) {
            st.pop_back();
        }
        st.push_back(a[i]);
        i = j - 1;
    }

    ld answer = 0;
    while (st.size() >= 2 && cross(st[0], st[1]) < 0) {
        st.pop_front();
    }
    while (st.size() >= 2 && cross(st[st.size() - 2], st.back()) > L) {
        st.pop_back();
    }
    answer = std::max(answer, solve(0, cross(st[0], st[1]), st[0]));
    answer = std::max(answer, solve(cross(st[st.size() - 2], st.back()), L, st.back()));
    for (int i = 1; i < st.size() - 1; i++) {
        answer = std::max(answer, solve(cross(st[i - 1], st[i]), cross(st[i], st[i + 1]), st[i]));
    }
    std::cout << answer << "\n";
    return 0;
}

Compilation message

mobile.cpp: In function 'int main()':
mobile.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int i = 1; i < st.size() - 1; 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 348 KB Output is correct

Subtask #2
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 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 1 ms 520 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 5.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 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1116 KB Output is correct
2 Incorrect 12 ms 860 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1076 KB Output is correct
2 Correct 12 ms 1628 KB Output is correct
3 Incorrect 14 ms 1884 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1880 KB Output is correct
2 Incorrect 13 ms 860 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 1112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1628 KB Output is correct
2 Incorrect 15 ms 1112 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 8528 KB Output is correct
2 Correct 77 ms 4364 KB Output is correct
3 Correct 87 ms 4360 KB Output is correct
4 Incorrect 93 ms 4188 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 4188 KB Output is correct
2 Correct 87 ms 4708 KB Output is correct
3 Incorrect 72 ms 5144 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 10064 KB Output is correct
2 Correct 93 ms 4956 KB Output is correct
3 Correct 89 ms 4956 KB Output is correct
4 Incorrect 111 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 4956 KB Output is correct
2 Correct 98 ms 5484 KB Output is correct
3 Correct 83 ms 5652 KB Output is correct
4 Incorrect 109 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 11600 KB Output is correct
2 Correct 124 ms 5724 KB Output is correct
3 Correct 108 ms 5928 KB Output is correct
4 Incorrect 128 ms 5724 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 5724 KB Output is correct
2 Correct 113 ms 6224 KB Output is correct
3 Incorrect 102 ms 6992 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 13268 KB Output is correct
2 Correct 122 ms 6716 KB Output is correct
3 Correct 121 ms 6708 KB Output is correct
4 Incorrect 182 ms 6488 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 6488 KB Output is correct
2 Correct 145 ms 6996 KB Output is correct
3 Incorrect 111 ms 7476 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 16356 KB Output is correct
2 Correct 157 ms 8480 KB Output is correct
3 Runtime error 181 ms 16468 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 8284 KB Output is correct
2 Correct 174 ms 8780 KB Output is correct
3 Incorrect 144 ms 9812 KB Output isn't correct
4 Halted 0 ms 0 KB -