Submission #914988

# Submission time Handle Problem Language Result Execution time Memory
914988 2024-01-23T05:21:02 Z Em1L Mobile (BOI12_mobile) C++17
12 / 100
266 ms 16472 KB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using tiiii = tuple<int, int, ll, ll>;

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

    int n, L; cin >> n >> L;

    vector < int > x(n), y(n);

    for (int i = 0; i < n; i++)
        cin >> x[i] >> y[i];

    auto Good = [&](double dist) {
        double r = 0;

        for (int i = 0; i < n; i++) {
            if (y[i] > dist)
                continue;

            double left = x[i] - sqrt(dist * dist - y[i] * y[i]);
            double right = x[i] + sqrt(dist * dist - y[i] * y[i]);

            if (left <= r)
                r = max(r, right);
        }

        return r >= L;
    };

    double l = -0.1, m, r = 2e+9;

    while (r - l > 1e-3) {
        m = (l + r) / 2;

        if (Good(m))
            r = m;
        else
            l = m;
    }

    cout << setprecision(4) << fixed << r << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Incorrect 3 ms 568 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Incorrect 3 ms 404 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 424 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Incorrect 4 ms 500 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 22 ms 1368 KB Output is correct
2 Incorrect 20 ms 1628 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 26 ms 1832 KB Output is correct
2 Correct 36 ms 1624 KB Output is correct
3 Incorrect 44 ms 1624 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 21 ms 1624 KB Output is correct
2 Incorrect 21 ms 1884 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 25 ms 2392 KB Output is correct
2 Incorrect 26 ms 2140 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 26 ms 2396 KB Output is correct
2 Incorrect 26 ms 2392 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 112 ms 6924 KB Output is correct
2 Incorrect 131 ms 8476 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 126 ms 8972 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 152 ms 8416 KB Output is correct
2 Incorrect 156 ms 10264 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 152 ms 10340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 155 ms 9040 KB Output is correct
2 Incorrect 176 ms 11820 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 183 ms 12116 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 176 ms 10552 KB Output is correct
2 Incorrect 206 ms 13364 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 203 ms 13636 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 221 ms 13136 KB Output is correct
2 Incorrect 266 ms 16472 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 244 ms 8280 KB Output isn't correct
2 Halted 0 ms 0 KB -