oj.uz

Submission #654440

# Submission time Handle Problem Language Result Execution time Memory
654440 2022-10-31T10:00:04 Z yhussain11 Mobile (BOI12_mobile) C++17
100 / 100
 592 ms 15980 KB 
#include<bits/stdc++.h>

#define unless(x) if (!(x))
#define pb push_back
#define eb emplace_back
/* #define f first */
/* #define s second */
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mem(x, y) memset(x, y, sizeof(x))
#define sz(x) ((int) (x).size())
#define popcnt __builtin_popcntll

using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vpi = vector<pi>;
using vpll = vector<pll>;
using vvi = vector<vector<int>>;

// *INDENT-OFF*
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template<typename T, typename V> void __print(const pair<T, V> &x) { cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}'; }
template<size_t I = 0, typename... Tp> void __print_tup(const tuple<Tp...>& t) { cerr << get<I>(t); if constexpr(I < sizeof...(Tp) - 1) { cerr << ", "; __print_tup<I+1>(t); } }
template<typename... Tp> void __print(const tuple<Tp...>& t) { cerr << '{'; __print_tup(t); cerr << '}'; }
/* template<typename... Args> void __print(const tuple<Args...>& t) { cerr << '{'; apply([](auto&&... args) { ((cout << args << ','), ...); }, t); cerr << '}'; } */
template<typename T> void __print(const T &x) { int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
template<typename T> T fdiv(T x, T y) { T q = x / y; T r = x % y; if ((r != 0) && ((r < 0) != (y < 0))) --q; return q; }
template<typename T> T cdiv(T x, T y) { return x / y + ((x % y != 0) ? !((x > 0) ^ (y > 0)) : 0); }
namespace std { template<class Fun> class y_combinator_result { Fun fun_; public: template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {} template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); } }; template<class Fun> decltype(auto) yy(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); } }
const string yes = "Yes";
const string no = "No";
const int infs = 0x3f;
const int infb = 0x3f3f3f3f;
#ifdef LOCAL
#define dbg(x...) cerr << "\e[1;31m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[0m";
#else
#define dbg(x...)
#endif
// *INDENT-ON*

// YOU ARE ACTUALLY **SUPPOSED** TO READ THE FOLLOWING.
// Read the problem. Now Re-read the problem.
// Observe each constraint. Please do this. Notice each and every constraint.
// You have made many mistakes because you didn't read the constraint well enough.
// You are probably solving a harder version of the given problem.
// DO NOT OVERSOLVE.
// Do not look ahead for next problem. Solve the current problem.
// Do not look at standings.
// check overflow/underflow
// Declare double values as long double or ld (NEVER double, because of precision issues)
// Open the damn Excel Sheet!!!!

// BE EXTRA EXTRA EXTRA CAREFUL WHILE MULTIPLYING!!!!! <- SEE THIS!!! SEE THIS!!!

void solve() {
    int n, l;
    cin >> n >> l;
    vpll v(n);
    for (auto &[a, b] : v) {
        cin >> a >> b;
    }
    ld epsilon = 1.0L / 1e9;
    ld lo = 0, hi = 4e9;
    while (hi - lo > epsilon) {
        ld mid = (lo + hi) / 2;
        ld curr = 0;
        for (auto [a, b] : v) {
            if (mid >= abs(b)) {
                ld D = mid * mid - b * b;
                ld lefti = a - sqrt(D);
                ld righti = a + sqrt(D);
                if (lefti <= curr) ckmax(curr, righti);
            }
        }
        if (curr >= l) {
            hi = mid;
        } else {
            lo = mid;
        }
    }
    cout << fixed << setprecision(6) << lo << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    /* cin >> t; */
    while (t--) {
        solve();
    }
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 396 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1492 KB Output is correct
2 Correct 38 ms 1492 KB Output is correct
3 Correct 24 ms 1108 KB Output is correct
4 Correct 27 ms 1492 KB Output is correct
5 Correct 17 ms 1108 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1492 KB Output is correct
2 Correct 29 ms 1364 KB Output is correct
3 Correct 30 ms 1492 KB Output is correct
4 Correct 27 ms 1492 KB Output is correct
5 Correct 33 ms 1620 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1620 KB Output is correct
2 Correct 41 ms 1620 KB Output is correct
3 Correct 41 ms 1620 KB Output is correct
4 Correct 34 ms 1876 KB Output is correct
5 Correct 33 ms 1620 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1876 KB Output is correct
2 Correct 51 ms 1876 KB Output is correct
3 Correct 44 ms 1876 KB Output is correct
4 Correct 39 ms 1876 KB Output is correct
5 Correct 34 ms 1876 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 1876 KB Output is correct
2 Correct 61 ms 1876 KB Output is correct
3 Correct 44 ms 1876 KB Output is correct
4 Correct 35 ms 1876 KB Output is correct
5 Correct 34 ms 1876 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 8148 KB Output is correct
2 Correct 279 ms 8148 KB Output is correct
3 Correct 248 ms 8148 KB Output is correct
4 Correct 168 ms 8148 KB Output is correct
5 Correct 174 ms 8148 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 8148 KB Output is correct
2 Correct 341 ms 8148 KB Output is correct
3 Correct 233 ms 8148 KB Output is correct
4 Correct 194 ms 8080 KB Output is correct
5 Correct 195 ms 8148 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 9684 KB Output is correct
2 Correct 316 ms 9684 KB Output is correct
3 Correct 320 ms 9684 KB Output is correct
4 Correct 204 ms 9684 KB Output is correct
5 Correct 211 ms 9684 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 9684 KB Output is correct
2 Correct 397 ms 9684 KB Output is correct
3 Correct 259 ms 9684 KB Output is correct
4 Correct 191 ms 9684 KB Output is correct
5 Correct 194 ms 9684 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 11220 KB Output is correct
2 Correct 353 ms 11220 KB Output is correct
3 Correct 358 ms 11220 KB Output is correct
4 Correct 226 ms 11220 KB Output is correct
5 Correct 247 ms 11220 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 11240 KB Output is correct
2 Correct 470 ms 11220 KB Output is correct
3 Correct 322 ms 11220 KB Output is correct
4 Correct 236 ms 11220 KB Output is correct
5 Correct 251 ms 11220 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 474 ms 12792 KB Output is correct
2 Correct 453 ms 12756 KB Output is correct
3 Correct 469 ms 12756 KB Output is correct
4 Correct 279 ms 12756 KB Output is correct
5 Correct 275 ms 12756 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 12756 KB Output is correct
2 Correct 507 ms 12756 KB Output is correct
3 Correct 356 ms 12756 KB Output is correct
4 Correct 264 ms 12816 KB Output is correct
5 Correct 257 ms 12756 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 491 ms 15912 KB Output is correct
2 Correct 496 ms 15956 KB Output is correct
3 Correct 493 ms 15956 KB Output is correct
4 Correct 329 ms 15956 KB Output is correct
5 Correct 332 ms 15980 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 512 ms 15956 KB Output is correct
2 Correct 592 ms 15956 KB Output is correct
3 Correct 449 ms 15956 KB Output is correct
4 Correct 319 ms 15956 KB Output is correct
5 Correct 320 ms 15956 KB Output is correct