oj.uz

Submission #481854

# Submission time Handle Problem Language Result Execution time Memory
481854 2021-10-22T03:47:55 Z sberens Mobile (BOI12_mobile) C++17
50 / 100
 1000 ms 65484 KB 
#pragma GCC optimize ("fast-math")

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename K> using hset = gp_hash_table<K, null_type>;
template <typename K, typename V> using hmap = gp_hash_table<K, V>;


using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define smax(x, y) (x = max(x, y))
#define smin(x, y) (x = min(x, y))

using ld = long double;
using ll = long long;

template <typename T>
using vv = vector<vector<T>>;

using vi = vector<int>;
using ii = array<int, 2>;
using vii = vector<ii>;
using vvi = vv<int>;

using vll = vector<ll>;
using l2 = array<int, 2>;
using vl2 = vector<l2>;
using vvll = vv<ll>;

template <typename T>
using minq = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxq = priority_queue<T>;

const ll M = 1000000007;

#ifndef REFERENCE_DISCRETE_BINARY_SEARCH_H
#define REFERENCE_DISCRETE_BINARY_SEARCH_H


#include <iostream>
#include <functional>


template<typename IN>
IN discrete_binary_search(function<bool(IN)> predicate, IN low = 0, IN high = numeric_limits<IN>::max()) {
    while (fabs(high - low) > 1e-4) {
        IN middle = low + (high - low) / 2; // todo std::midpoint in cpp 2020
        if (predicate(middle))
            high = middle;
        else low = middle;
    }
    return low;
}

#endif //REFERENCE_DISCRETE_BINARY_SEARCH_H

inline bool a_contains_b(array<ld, 2> a,  array<ld, 2> b) {
    return a[0] <= b[0] && b[1] <= a[1];
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, l;
    cin >> n >> l;
    vll x(n), y(n);
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> y[i];
    }

    cout << fixed << setprecision(4) <<  discrete_binary_search<ld>([&](ld d) -> bool {
        // is there a point with min distance > d
        // equivalently, is every point within distance d

        vector<array<ld, 2>> intervals;
        // add to intervals
        for (int i = 0; i < n; ++i) {
            if (abs(y[i]) > d) continue;
            ld dx = sqrt(d * d - y[i] * y[i]);
            // get rid of nested intervals
            array<ld, 2> new_interval{x[i] - dx, x[i] + dx};
            while (!intervals.empty() && a_contains_b(new_interval, intervals.back())) {
                intervals.pop_back();
            }
            if (!(!intervals.empty() && a_contains_b(intervals.back(), new_interval)))
                intervals.pb({x[i] - dx, x[i] + dx});
        }

        // merge intervals
        vector<array<ld, 2>> merged;
        for (auto [s, e] : intervals) {
            if (!merged.empty() && s <= merged.back()[1]) smax(merged.back()[1], e);
            else merged.pb({s, e});
        }
        // check interval spans whole highway
        return any_of(all(merged), [&](array<ld, 2> interval) -> bool {return a_contains_b(interval, {0, (ld) l});});

    }, 0, 2e15) << '\n';

}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 7 ms 572 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 7 ms 564 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 596 KB Output is correct
2 Correct 16 ms 816 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 10 ms 888 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 628 KB Output is correct
2 Correct 19 ms 1024 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 11 ms 812 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 812 KB Output is correct
2 Correct 16 ms 808 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 8 ms 808 KB Output is correct
5 Correct 7 ms 332 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 7824 KB Output is correct
2 Correct 153 ms 5376 KB Output is correct
3 Correct 136 ms 5084 KB Output is correct
4 Correct 116 ms 8084 KB Output is correct
5 Correct 59 ms 1100 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 1944 KB Output is correct
2 Correct 115 ms 4592 KB Output is correct
3 Correct 135 ms 7924 KB Output is correct
4 Correct 124 ms 8164 KB Output is correct
5 Correct 112 ms 8532 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 8648 KB Output is correct
2 Correct 142 ms 5328 KB Output is correct
3 Correct 214 ms 8092 KB Output is correct
4 Correct 135 ms 9080 KB Output is correct
5 Correct 108 ms 3284 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 5372 KB Output is correct
2 Correct 147 ms 5332 KB Output is correct
3 Correct 101 ms 2920 KB Output is correct
4 Correct 107 ms 9116 KB Output is correct
5 Correct 162 ms 8632 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 9252 KB Output is correct
2 Correct 139 ms 5332 KB Output is correct
3 Correct 103 ms 2924 KB Output is correct
4 Correct 127 ms 9092 KB Output is correct
5 Correct 163 ms 8944 KB Output is correct

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 9156 KB Output is correct
2 Execution timed out 1085 ms 40160 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 1093 ms 59116 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 516 ms 10468 KB Output is correct
2 Execution timed out 1091 ms 59068 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 1087 ms 60620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 11896 KB Output is correct
2 Execution timed out 1097 ms 60564 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 1096 ms 62132 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 711 ms 13416 KB Output is correct
2 Execution timed out 1096 ms 62124 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 1084 ms 65480 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

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