oj.uz

Submission #738438

# Submission time Handle Problem Language Result Execution time Memory
738438 2023-05-08T18:48:34 Z xjonwang Mobile (BOI12_mobile) C++17
55 / 100
 1000 ms 65396 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ar array

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define pll pair<ll, ll>

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

template<class T> bool umin(T& a, const T& b) {
	return b<a?a=b, 1:0;
}
template<class T> bool umax(T& a, const T& b) { 
	return a<b?a=b, 1:0;
} 

ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb)/2;
		f(mb)?rb=mb:lb=mb+1; 
	} 
	return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb+1)/2;
		f(mb)?lb=mb:rb=mb-1; 
	} 
	return lb;
}

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class A, class B> void read(pair<A, B>& x);
template<class T> void read(T& x) {
	cin >> x;
}
void read(double& d) {
	string t;
	read(t);
	d=stod(t);
}
void read(long double& d) {
	string t;
	read(t);
	d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
	read(h);
	read(t...);
}
template<class A> void read(vt<A>& x) {
	EACH(a, x)
		read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
	EACH(a, x)
		read(a);
}
template<class A, class B> void read(pair<A, B>& x) {
	cin >> x.first >> x.second;
}


string to_string(char c) {
	return string(1, c);
}
string to_string(bool b) {
	return b?"true":"false";
}
string to_string(const char* s) {
	return string(s);
}
string to_string(string s) {
	return s;
}
string to_string(vt<bool> v) {
	string res;
	FOR(sz(v))
		res+=char('0'+v[i]);
	return res;
}

template<size_t S> string to_string(bitset<S> b) {
	string res;
	FOR(S)
		res+=char('0'+b[i]);
	return res;
}
template<class T> string to_string(T v) {
    bool f=1;
    string res;
    EACH(x, v) {
		if(!f)
			res+=' ';
		f=0;
		res+=to_string(x);
	}
    return res;
}

template<class A> void write(A x) {
	cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) { 
	write(h);
	write(t...);
}
void print() {
	write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) { 
	write(h);
	if(sizeof...(t))
		write(' ');
	print(t...);
}

ll n, l;
vt<pll> v;

bool check(ld d) {
	vt<pair<ld, ld>> points;
	EACH(p, v) {
		if (d>abs(p.second)) {
			ld x=sqrtl(d*d-p.second*p.second);
			points.pb({p.first-x, 2*x});
		}
	}
	ld r=0;
	EACH(p, points) {
		if (p.first<=r) r=max(r, p.first+p.second);
	}
	return r>=l;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> l;
	v.resize(n);
	FOR(n) cin >> v[i].first >> v[i].second;
	ld i=1, j=2.5e9;
	while (j-i>1e-4) {
		ld mid=(i+j)/2;
		if (check(mid)) j=mid;
		else i=mid;
	}
	cout << fixed << setprecision(3);
	cout << i << endl;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 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 588 KB Output is correct
2 Correct 5 ms 588 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 5 ms 572 KB Output is correct

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 820 KB Output is correct
2 Correct 9 ms 816 KB Output is correct
3 Correct 6 ms 816 KB Output is correct
4 Correct 4 ms 816 KB Output is correct
5 Correct 6 ms 824 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 8020 KB Output is correct
2 Correct 178 ms 8112 KB Output is correct
3 Correct 90 ms 4944 KB Output is correct
4 Correct 68 ms 8036 KB Output is correct
5 Correct 54 ms 4860 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 8352 KB Output is correct
2 Correct 77 ms 7820 KB Output is correct
3 Correct 71 ms 8304 KB Output is correct
4 Correct 67 ms 8180 KB Output is correct
5 Correct 56 ms 8568 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 8704 KB Output is correct
2 Correct 173 ms 8508 KB Output is correct
3 Correct 103 ms 8508 KB Output is correct
4 Correct 47 ms 9084 KB Output is correct
5 Correct 98 ms 8676 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 9276 KB Output is correct
2 Correct 202 ms 9224 KB Output is correct
3 Correct 178 ms 9232 KB Output is correct
4 Correct 49 ms 9092 KB Output is correct
5 Correct 86 ms 9184 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 9232 KB Output is correct
2 Correct 224 ms 9232 KB Output is correct
3 Correct 178 ms 9236 KB Output is correct
4 Correct 53 ms 9116 KB Output is correct
5 Correct 89 ms 9220 KB Output is correct

Subtask #12
0 / 5.0

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

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 991 ms 40328 KB Output is correct
2 Correct 735 ms 46912 KB Output is correct
3 Correct 897 ms 46200 KB Output is correct
4 Correct 282 ms 49632 KB Output is correct
5 Correct 358 ms 47584 KB Output is correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1072 ms 59168 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 1068 ms 59260 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 1068 ms 60680 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 1079 ms 60616 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 1067 ms 62176 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 1063 ms 62236 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 1070 ms 65396 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 1073 ms 65368 KB Time limit exceeded
2 Halted 0 ms 0 KB -