oj.uz

Submission #1112828

# Submission time Handle Problem Language Result Execution time Memory
1112828 2024-11-15T02:31:11 Z erentor353 Mobile (BOI12_mobile) C++17
0 / 100
 382 ms 31420 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
template<typename T> using oset = 
__gnu_pbds::tree<T, __gnu_pbds::null_type, greater<T>, 
__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>; 
#define vt vector
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define ll long long
#define ull unsigned ll
#define ld long double
#define okey order_of_key
#define oget find_by_order
typedef vt<int> vi;
typedef pair<int,int> pi;
typedef pair<ll, ll> pll;
const ll MAXN = 1e6;
const ll MAXM = 60;
const ll MAXL = 31;
const ll MOD = 1e9 + 7;
ll N, L, x[MAXN], y[MAXN];
bool check(double r){
	double maximum = 0;
	for(int i = 0; i<N; ++i){
		double diff = r*r-(double)(y[i]*y[i]);
		if(diff < 0) continue;
		double sqt = sqrt(diff);
		double x1 = x[i] - sqt;
		double x2 = sqt + x[i];
		if(x1 > maximum) return false;
		maximum = max(maximum, x2);
	}
	
	return maximum >= L;
}
void solve(){
	cin>>N>>L;
	for(int i = 0; i<N; ++i){
		cin>>x[i]>>y[i];
	}
	
	double lo = 0, hi = 1e13;
	int cnt = 0;
	while(lo < hi && cnt++ <= MAXM){
		double mid = (hi + lo)/2;
		if(check(mid)){
			hi = mid;
		}else{
			lo = mid + 0.001;
		}
	}
	
	printf("%.4f\n", hi);
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t = 1;
	//cin>>t;
	while(t--) solve();
}

Subtask #1
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 Incorrect 1 ms 336 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
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 Incorrect 1 ms 336 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Incorrect 2 ms 592 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 2384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 2204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2128 KB Output is correct
2 Incorrect 25 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 2896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 3236 KB Output is correct
2 Incorrect 33 ms 3408 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 8204 KB Output is correct
2 Correct 135 ms 12364 KB Output is correct
3 Correct 152 ms 15544 KB Output is correct
4 Incorrect 155 ms 17748 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 12496 KB Output is correct
2 Incorrect 248 ms 14728 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 12616 KB Output is correct
2 Incorrect 145 ms 18928 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 14920 KB Output is correct
2 Incorrect 241 ms 17764 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 14664 KB Output is correct
2 Incorrect 177 ms 22240 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 11336 KB Output is correct
2 Incorrect 269 ms 20664 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 12872 KB Output is correct
2 Incorrect 208 ms 12868 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 19784 KB Output is correct
2 Incorrect 367 ms 12848 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 15944 KB Output is correct
2 Incorrect 282 ms 31420 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 24424 KB Output is correct
2 Incorrect 382 ms 29272 KB Output isn't correct
3 Halted 0 ms 0 KB -