oj.uz

Submission #941580

# Submission time Handle Problem Language Result Execution time Memory
941580 2024-03-09T07:40:19 Z Kavelmydex Mobile (BOI12_mobile) C++17
35 / 100
 1000 ms 18616 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define ld long double
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define pb push_back
#define endl "\n"
#define sp ' '
#define f first
#define s second
#define sz size()
#define all(x) (x).begin(),(x).end()

const int N = 3e5+10, OO = 1e18, mod = 1e9+7;
void tr(int a, int b){cout << a << sp << b << endl;}
void cmx(int &a, int b){a = max(a,b);}
void cmn(int &a, int b){a = min(a,b);}

vector <pi> v;
int n,L;
ld sqr(ld x){
    ld l = 0, r = 2236067977;
    For(i,60){
        ld m = (l+r)/2;
        if(m * m >= x) r = m;
        else l = m;
    }
    return r;
}
bool ok(ld m){
    ld mn = 2e9, mx = -2e9, z = 0;
    For(i,n){
        auto [x,y] = v[i];
        if(y*y > m*m) continue;
        ld d = sqr(m * m - y * y);
        if(x-d <= z && z <= x+d){
            z = x+d;
        }   
        if(x-d < mn) mn = x-d;
        if(mx < x+d) mx = x+d;    
        if(mn <= 0 && L <= mx && z >= L) return 1;
    }
    return 0;
}
int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> L;
    For(i,n){
        int x,y; cin >> x >> y;
        v.pb({x,y});
    }
    ld l = 0, r = 2236067977;
    For(i,60){
        ld m = (l+r)/2;
        if(ok(m)) r = m;
        else l = m;
    }
    cout << setprecision(20) << r << endl;
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 53 ms 348 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 63 ms 348 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 63 ms 604 KB Output is correct
3 Correct 43 ms 684 KB Output is correct
4 Correct 9 ms 604 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 604 KB Output is correct
2 Correct 64 ms 716 KB Output is correct
3 Correct 41 ms 600 KB Output is correct
4 Correct 9 ms 604 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 604 KB Output is correct
2 Correct 63 ms 716 KB Output is correct
3 Correct 41 ms 604 KB Output is correct
4 Correct 9 ms 600 KB Output is correct
5 Correct 7 ms 604 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 770 ms 2520 KB Output is correct
2 Correct 883 ms 3544 KB Output is correct
3 Correct 511 ms 2012 KB Output is correct
4 Correct 80 ms 3796 KB Output is correct
5 Correct 44 ms 2008 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 2516 KB Output is correct
2 Correct 68 ms 3456 KB Output is correct
3 Correct 78 ms 3608 KB Output is correct
4 Correct 81 ms 3544 KB Output is correct
5 Correct 90 ms 3796 KB Output is correct

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

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

Subtask #21
0 / 5.0

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