Submission #551197

# Submission time Handle Problem Language Result Execution time Memory
551197 2022-04-20T05:15:54 Z narcissus Mobile (BOI12_mobile) C++17
0 / 100
775 ms 24600 KB
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int main()
{
    int n, l;
    cin >> n >> l;
    pair<int, int> coords[n];
    for (int i = 0; i < n; i++) {
        cin >> coords[i].first >> coords[i].second;
    }

    double low = 0, high = l;
    while (high - low >= 1e-3) {
        double mid = low + (high - low) / 2;
        // cout << mid << ":" << endl;
        bool flag = true;
        pair<double, double> inter, prevInter;
        double minv = l, maxv = 0;
        for (int i = 0; i < n; i++) {
            int x = coords[i].first;
            int y = coords[i].second;
            double xdist = sqrt(pow(mid, 2) - pow(y, 2));
            double a1 = max((double)0, -xdist + x);
            double a2 = min((double)l, xdist + x);
            minv = min(minv, a1);
            maxv = max(maxv, a2);
            // cout << "a " << a1 << ' ' << a2 << endl;
            inter = {a1, a2};
            if (i) {
                if (a1 > prevInter.second) {
                    flag = false;
                    break;
                }
            }
            prevInter = inter;
        }
        if (flag && minv <= 0 && maxv >= l) {
            high = mid;
        } else {
            low = mid;
        }
    }
    cout << high << endl;

    return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 1652 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 1632 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 48 ms 1632 KB Output is correct
2 Incorrect 62 ms 2052 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 78 ms 2708 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 69 ms 2572 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 304 ms 8472 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 389 ms 12384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 325 ms 10160 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 509 ms 14820 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 388 ms 11796 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 570 ms 17264 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 454 ms 13428 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 669 ms 19788 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 555 ms 16780 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 775 ms 24600 KB Output isn't correct
2 Halted 0 ms 0 KB -