답안 #481882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481882	2021-10-22T05:11:34 Z	sberens	Mobile (BOI12_mobile)	C++17	100 / 100	754 ms	16076 KB

mobile

//#pragma GCC optimize ("Ofast,fast-math,inline")

#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 = 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

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;
        intervals.reserve(n);
        // 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]);
            ld s1 = x[i] - dx, e1 = x[i] + dx;
            // can merge in place
            while (!intervals.empty()) {
                auto & [s2, e2] = intervals.back();
                if (max(s1, s2) <= min(e1, e2)) {
                    smin(s1, s2);
                    smax(e1, e2);
                    intervals.pop_back();
                } else break;
            }
            intervals.pb({s1, e1});
        }

        // check interval spans whole highway
        for (auto [s, e] : intervals) {
            if (s <= 0 && l <= e) return true;
        }
        return false;

    }, 0, sqrt(1e18 + 4 * 1e18 + 1e10)) << '\n';

}

Subtask #1
4.0 / 4.0

#	결과	메모리	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct

Subtask #2
4.0 / 4.0

#	결과	메모리	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	332 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct

Subtask #4
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	332 KB	Output is correct
2	Correct	5 ms	332 KB	Output is correct
3	Correct	4 ms	332 KB	Output is correct
4	Correct	3 ms	332 KB	Output is correct

Subtask #5
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	396 KB	Output is correct
2	Correct	4 ms	332 KB	Output is correct
3	Correct	4 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct

Subtask #6
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	332 KB	Output is correct
2	Correct	5 ms	392 KB	Output is correct
3	Correct	4 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	3 ms	332 KB	Output is correct

Subtask #7
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	52 ms	1504 KB	Output is correct
2	Correct	58 ms	1528 KB	Output is correct
3	Correct	34 ms	1160 KB	Output is correct
4	Correct	29 ms	1516 KB	Output is correct
5	Correct	23 ms	1100 KB	Output is correct

Subtask #8
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	1484 KB	Output is correct
2	Correct	32 ms	1356 KB	Output is correct
3	Correct	38 ms	1612 KB	Output is correct
4	Correct	31 ms	1484 KB	Output is correct
5	Correct	35 ms	1688 KB	Output is correct

Subtask #9
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	64 ms	1700 KB	Output is correct
2	Correct	62 ms	1620 KB	Output is correct
3	Correct	54 ms	1652 KB	Output is correct
4	Correct	33 ms	1888 KB	Output is correct
5	Correct	43 ms	1716 KB	Output is correct

Subtask #10
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	1880 KB	Output is correct
2	Correct	75 ms	1892 KB	Output is correct
3	Correct	63 ms	1900 KB	Output is correct
4	Correct	35 ms	1892 KB	Output is correct
5	Correct	41 ms	1888 KB	Output is correct

Subtask #11
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	76 ms	1896 KB	Output is correct
2	Correct	78 ms	1884 KB	Output is correct
3	Correct	64 ms	1896 KB	Output is correct
4	Correct	32 ms	1892 KB	Output is correct
5	Correct	41 ms	1892 KB	Output is correct

Subtask #12
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	348 ms	8144 KB	Output is correct
2	Correct	392 ms	8140 KB	Output is correct
3	Correct	366 ms	8148 KB	Output is correct
4	Correct	157 ms	8260 KB	Output is correct
5	Correct	201 ms	8148 KB	Output is correct

Subtask #13
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	375 ms	8140 KB	Output is correct
2	Correct	351 ms	8388 KB	Output is correct
3	Correct	302 ms	8140 KB	Output is correct
4	Correct	162 ms	8144 KB	Output is correct
5	Correct	193 ms	8140 KB	Output is correct

Subtask #14
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	420 ms	9708 KB	Output is correct
2	Correct	461 ms	9704 KB	Output is correct
3	Correct	450 ms	9676 KB	Output is correct
4	Correct	182 ms	9796 KB	Output is correct
5	Correct	239 ms	9704 KB	Output is correct

Subtask #15
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	457 ms	9708 KB	Output is correct
2	Correct	402 ms	9832 KB	Output is correct
3	Correct	377 ms	9708 KB	Output is correct
4	Correct	197 ms	9692 KB	Output is correct
5	Correct	229 ms	9712 KB	Output is correct

Subtask #16
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	487 ms	11332 KB	Output is correct
2	Correct	517 ms	11276 KB	Output is correct
3	Correct	513 ms	11284 KB	Output is correct
4	Correct	217 ms	11212 KB	Output is correct
5	Correct	279 ms	11272 KB	Output is correct

Subtask #17
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	528 ms	11212 KB	Output is correct
2	Correct	458 ms	11324 KB	Output is correct
3	Correct	441 ms	11324 KB	Output is correct
4	Correct	220 ms	11212 KB	Output is correct
5	Correct	257 ms	11272 KB	Output is correct

Subtask #18
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	561 ms	12964 KB	Output is correct
2	Correct	602 ms	12836 KB	Output is correct
3	Correct	577 ms	12748 KB	Output is correct
4	Correct	250 ms	12956 KB	Output is correct
5	Correct	305 ms	12748 KB	Output is correct

Subtask #19
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	604 ms	12860 KB	Output is correct
2	Correct	509 ms	12860 KB	Output is correct
3	Correct	506 ms	12932 KB	Output is correct
4	Correct	254 ms	12748 KB	Output is correct
5	Correct	306 ms	12840 KB	Output is correct

Subtask #20
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	705 ms	15972 KB	Output is correct
2	Correct	754 ms	15976 KB	Output is correct
3	Correct	737 ms	16064 KB	Output is correct
4	Correct	322 ms	16068 KB	Output is correct
5	Correct	399 ms	15984 KB	Output is correct

Subtask #21
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	754 ms	16076 KB	Output is correct
2	Correct	624 ms	16068 KB	Output is correct
3	Correct	627 ms	15976 KB	Output is correct
4	Correct	320 ms	15952 KB	Output is correct
5	Correct	378 ms	15976 KB	Output is correct

답안 #481882

Compilation message