oj.uz

답안 #1026841

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1026841 2024-07-18T12:17:18 Z PooyaDaftarian Mobile (BOI12_mobile) C++17
12 / 100
 560 ms 8284 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;

#define all(x) x.begin(), x.end()
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(x) freopen(x ".in", "r", stdin); freopen(x ".out", "w", stdout)
#define endl '\n'
#define pb push_back
#define ms(x, y) memset(x, y, sizeof x)
#define out(x) {cout << x << '\n'; return;}
#define ff first
#define ss second
#define sz(x) (int)(x).size()
#define int ll

int n, L;
vector<pii> a;

bool chk(ld x){
    ld mx = 0;
    for (int i = 0 ; i < n ; i++){
        ld d = sqrt(x*x - a[i].ss*a[i].ss);
        ld x = a[i].ff - d, y = a[i].ff + d;
        if (x <= mx) mx = max(mx, y);
    }
    return (mx < L);
}

int32_t main(){
    fast_io;
    cout << fixed << setprecision(14);
	cin >> n >> L;
    a.assign(n, {0, 0});
    for (int i = 0 ; i < n ; i++){
        int x, h; cin >> x >> h;
        a[i] = {x, h};
    }
    ld l = 0, r = 1e10, mid;
    for (int i = 0 ; i < 80 ; i++){
        mid = l + (r-l)/2;
        if (chk(mid)) l = mid;
        else r = mid;
    }
    cout << l << endl;
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Incorrect 5 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Incorrect 5 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Incorrect 5 ms 492 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 856 KB Output is correct
2 Incorrect 41 ms 864 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 856 KB Output is correct
2 Correct 90 ms 860 KB Output is correct
3 Incorrect 115 ms 860 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 1116 KB Output is correct
2 Incorrect 45 ms 1112 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 1112 KB Output is correct
2 Incorrect 59 ms 1112 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 1112 KB Output is correct
2 Incorrect 56 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 286 ms 4184 KB Output is correct
2 Incorrect 252 ms 4188 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 247 ms 4188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 5208 KB Output is correct
2 Incorrect 298 ms 4952 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 293 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 399 ms 5720 KB Output is correct
2 Incorrect 362 ms 5724 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 321 ms 5720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 415 ms 6488 KB Output is correct
2 Incorrect 379 ms 6488 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 373 ms 6492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 560 ms 8284 KB Output is correct
2 Incorrect 450 ms 8284 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 471 ms 8284 KB Output isn't correct
2 Halted 0 ms 0 KB -