oj.uz

Submission #738439

# Submission time Handle Problem Language Result Execution time Memory
738439 2023-05-08T18:50:51 Z xjonwang Mobile (BOI12_mobile) C++17
100 / 100
 463 ms 35292 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;
	ld r=0;
	EACH(p, v) {
		if (d>abs(p.second)) {
			ld x=sqrtl(d*d-p.second*p.second);
			if (p.first-x<=r) r=max(r, p.first+x);
		}
	}
	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 1 ms 212 KB Output is correct
3 Correct 1 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 1 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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1492 KB Output is correct
2 Correct 36 ms 1528 KB Output is correct
3 Correct 19 ms 1108 KB Output is correct
4 Correct 31 ms 1504 KB Output is correct
5 Correct 15 ms 1108 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1556 KB Output is correct
2 Correct 23 ms 1364 KB Output is correct
3 Correct 25 ms 1588 KB Output is correct
4 Correct 24 ms 1492 KB Output is correct
5 Correct 25 ms 1620 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1620 KB Output is correct
2 Correct 34 ms 1620 KB Output is correct
3 Correct 29 ms 1620 KB Output is correct
4 Correct 29 ms 1876 KB Output is correct
5 Correct 34 ms 1720 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1876 KB Output is correct
2 Correct 39 ms 1876 KB Output is correct
3 Correct 34 ms 1876 KB Output is correct
4 Correct 30 ms 2004 KB Output is correct
5 Correct 29 ms 1904 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 1876 KB Output is correct
2 Correct 39 ms 1876 KB Output is correct
3 Correct 41 ms 1876 KB Output is correct
4 Correct 29 ms 1876 KB Output is correct
5 Correct 31 ms 1876 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 8144 KB Output is correct
2 Correct 233 ms 15868 KB Output is correct
3 Correct 220 ms 15436 KB Output is correct
4 Correct 169 ms 17744 KB Output is correct
5 Correct 148 ms 14928 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 8148 KB Output is correct
2 Correct 274 ms 8148 KB Output is correct
3 Correct 216 ms 8148 KB Output is correct
4 Correct 143 ms 8148 KB Output is correct
5 Correct 149 ms 8148 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 9708 KB Output is correct
2 Correct 248 ms 18992 KB Output is correct
3 Correct 245 ms 18416 KB Output is correct
4 Correct 207 ms 21484 KB Output is correct
5 Correct 180 ms 17644 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 9776 KB Output is correct
2 Correct 290 ms 17652 KB Output is correct
3 Correct 221 ms 16588 KB Output is correct
4 Correct 187 ms 21488 KB Output is correct
5 Correct 179 ms 18432 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 11272 KB Output is correct
2 Correct 289 ms 22264 KB Output is correct
3 Correct 308 ms 21504 KB Output is correct
4 Correct 220 ms 24828 KB Output is correct
5 Correct 214 ms 20220 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 11284 KB Output is correct
2 Correct 328 ms 20484 KB Output is correct
3 Correct 258 ms 19668 KB Output is correct
4 Correct 238 ms 24576 KB Output is correct
5 Correct 222 ms 21372 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 12836 KB Output is correct
2 Correct 334 ms 25264 KB Output is correct
3 Correct 386 ms 24504 KB Output is correct
4 Correct 250 ms 28492 KB Output is correct
5 Correct 253 ms 24024 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 12836 KB Output is correct
2 Correct 365 ms 23444 KB Output is correct
3 Correct 284 ms 22300 KB Output is correct
4 Correct 248 ms 28328 KB Output is correct
5 Correct 246 ms 24396 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 357 ms 15956 KB Output is correct
2 Correct 452 ms 31528 KB Output is correct
3 Correct 416 ms 30540 KB Output is correct
4 Correct 312 ms 35164 KB Output is correct
5 Correct 342 ms 29536 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 15956 KB Output is correct
2 Correct 463 ms 29200 KB Output is correct
3 Correct 377 ms 28256 KB Output is correct
4 Correct 306 ms 35292 KB Output is correct
5 Correct 300 ms 30712 KB Output is correct