oj.uz

Submission #1102818

# Submission time Handle Problem Language Result Execution time Memory
1102818 2024-10-19T03:41:30 Z Zero_OP Mobile (BOI12_mobile) C++14
80 / 100
 1000 ms 21324 KB 
#include <bits/stdc++.h>

using namespace std;

#define rep(i, l, r) for(int i = (l), _r = (r); i < _r; ++i)
#define FOR(i, l, r) for(int i = (l), _r = (r); i <= _r; ++i)
#define ROF(i, r, l) for(int i = (r), _l = (l); i >= _l; --i)
#define all(v) begin(v), end(v)
#define compact(v) v.erase(unique(all(v)), end(v))
#define sz(v) (int)v.size()
#define dbg(x) "[" #x " = " << (x) << "]"

template<typename T>
bool minimize(T& a, const T& b){
    if(a > b) return a = b, true; return false;
}

template<typename T>
bool maximize(T& a, const T& b){
    if(a < b) return a = b, true; return false;
}

using ll = long long;
using ld = double;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T> T random_int(T l, T r){ return uniform_int_distribution<T>(l, r)(rng); }
template<typename T> T random_real(T l, T r){ return uniform_real_distribution<T>(l, r)(rng); }

const ld eps = 1e-4;

struct point{
    ld x, y;
    point(ld x = 0, ld y = 0) : x(x), y(y) {}

    ld norm() const { return x * x + y * y; }
    ld dist() const { return sqrtl(norm()); }

    friend istream& operator >> (istream& in, point& p) { return in >> p.x >> p.y; }
};

void testcase(){
    int n;
    ld L;
    cin >> n >> L;
    vector<point> points(n);
    for(int i = 0; i < n; ++i) cin >> points[i];

    cout << fixed << setprecision(6);
    ld l = 0, r = sqrt(2e18) + 10;

    int rep = 0;
    while(r - l > eps){
        ld mid = (l + r) / 2.0l;
        ld mid2 = mid * mid;

        ld last_cover = 0.0;
        for(int i = 0; i < n; ++i){
            ld p = points[i].y * points[i].y;
            ld q = sqrtl(mid2 - p);
            ld cover_left = points[i].x - q;
            ld cover_right = points[i].x + q;
            if(cover_left <= last_cover){
                last_cover = max(last_cover, cover_right);
            }
        }

        if(last_cover >= L) r = mid;
        else l = mid;
    }

    cout << fixed << setprecision(6) << l << '\n';
}

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

    #define filename "task"
    if(fopen(filename".inp", "r")){
        freopen(filename".inp", "r", stdin);
        freopen(filename".out", "w", stdout);
    }

    int T = 1; //cin >> T;
    while(T--) testcase();

    return 0;
}

Compilation message

mobile.cpp: In function 'bool minimize(T&, const T&)':
mobile.cpp:15:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   15 |     if(a > b) return a = b, true; return false;
      |     ^~
mobile.cpp:15:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   15 |     if(a > b) return a = b, true; return false;
      |                                   ^~~~~~
mobile.cpp: In function 'bool maximize(T&, const T&)':
mobile.cpp:20:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   20 |     if(a < b) return a = b, true; return false;
      |     ^~
mobile.cpp:20:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   20 |     if(a < b) return a = b, true; return false;
      |                                   ^~~~~~
mobile.cpp: In function 'void testcase()':
mobile.cpp:52:9: warning: unused variable 'rep' [-Wunused-variable]
   52 |     int rep = 0;
      |         ^~~
mobile.cpp: In function 'int main()':
mobile.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(filename".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
mobile.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen(filename".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 336 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 5 ms 508 KB Output is correct
4 Correct 7 ms 336 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 508 KB Output is correct
2 Correct 4 ms 544 KB Output is correct
3 Correct 5 ms 336 KB Output is correct
4 Correct 7 ms 336 KB Output is correct

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 1616 KB Output is correct
2 Correct 59 ms 1616 KB Output is correct
3 Correct 44 ms 1104 KB Output is correct
4 Correct 93 ms 1616 KB Output is correct
5 Correct 55 ms 1104 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 1616 KB Output is correct
2 Correct 82 ms 1360 KB Output is correct
3 Correct 91 ms 1616 KB Output is correct
4 Correct 99 ms 1616 KB Output is correct
5 Correct 112 ms 1616 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1616 KB Output is correct
2 Correct 56 ms 1616 KB Output is correct
3 Correct 76 ms 1616 KB Output is correct
4 Correct 138 ms 1856 KB Output is correct
5 Correct 101 ms 1616 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1872 KB Output is correct
2 Correct 66 ms 1872 KB Output is correct
3 Correct 82 ms 1872 KB Output is correct
4 Correct 136 ms 1872 KB Output is correct
5 Correct 115 ms 1872 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1872 KB Output is correct
2 Correct 69 ms 1872 KB Output is correct
3 Correct 87 ms 1872 KB Output is correct
4 Correct 139 ms 1872 KB Output is correct
5 Correct 123 ms 2040 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 8272 KB Output is correct
2 Correct 326 ms 8272 KB Output is correct
3 Correct 308 ms 8272 KB Output is correct
4 Correct 641 ms 8272 KB Output is correct
5 Correct 567 ms 8272 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 8272 KB Output is correct
2 Correct 528 ms 8272 KB Output is correct
3 Correct 404 ms 8272 KB Output is correct
4 Correct 716 ms 8272 KB Output is correct
5 Correct 602 ms 8272 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 457 ms 9808 KB Output is correct
2 Correct 402 ms 9808 KB Output is correct
3 Correct 419 ms 9808 KB Output is correct
4 Correct 833 ms 9808 KB Output is correct
5 Correct 743 ms 17740 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 9836 KB Output is correct
2 Correct 674 ms 9808 KB Output is correct
3 Correct 489 ms 9808 KB Output is correct
4 Correct 839 ms 9808 KB Output is correct
5 Correct 703 ms 9808 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 508 ms 11344 KB Output is correct
2 Correct 440 ms 11344 KB Output is correct
3 Correct 471 ms 11344 KB Output is correct
4 Correct 906 ms 11344 KB Output is correct
5 Correct 839 ms 20360 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 459 ms 11344 KB Output is correct
2 Correct 732 ms 11512 KB Output is correct
3 Correct 568 ms 11344 KB Output is correct
4 Correct 924 ms 11344 KB Output is correct
5 Correct 866 ms 21324 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 578 ms 12880 KB Output is correct
2 Correct 528 ms 12880 KB Output is correct
3 Correct 521 ms 12880 KB Output is correct
4 Execution timed out 1063 ms 12880 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 12880 KB Output is correct
2 Correct 819 ms 12880 KB Output is correct
3 Correct 598 ms 12880 KB Output is correct
4 Execution timed out 1053 ms 12880 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 767 ms 15952 KB Output is correct
2 Correct 678 ms 15952 KB Output is correct
3 Correct 705 ms 15952 KB Output is correct
4 Execution timed out 1053 ms 15952 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 684 ms 15952 KB Output is correct
2 Execution timed out 1063 ms 15952 KB Time limit exceeded
3 Halted 0 ms 0 KB -