oj.uz

답안 #692486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
692486 2023-02-01T14:11:00 Z bojackduy Mobile (BOI12_mobile) C++14
0 / 100
 1000 ms 24644 KB 
#include <iostream>
#include <queue>
#include <stack>
#include <algorithm>
#include <string.h>
#include <functional>
#include <iomanip>
#define task "task"
#define size() size() * 1ll 
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define MASK(x) (1LL << (x))
#define BIT(x,i) (((x) >> (i)) & 1)
#define numbit(x) __builtin_popcountll(x)

using namespace std;

typedef vector<int> vi;
typedef vector<pii> vii;
typedef long long ll;

template<class t>
bool mini(t &x,t y) {
	if (y < x) {
	   x = y;
	   return 1;
	}
return 0;
}
template<class t>
bool maxi(t &x,t y) {
	if (x < y) {
	   x = y;
	   return 1;
	}
return 0;
}

const int N = 1e6 + 1;
const int M = 1e3 + 1;
const long long mod = 1e9 + 7;
const long long oo = 1e18 + 7;

void solve(int test = -1) {
	int n, m;
	cin >> n >> m;
	pii a[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i].fi >> a[i].se;
	}
	double l = 0, r = m;
	int t = 1000;
	long double ans = 0;
	while (t--) {
		double midl = (2 * l + r) / 3;
		double midr = (l + 2 * r) / 3;
		long double lef = 1e9;
		for (int i = 0; i < n; i++) {
			mini(lef, __builtin_sqrtl((long double)abs(midl - a[i].fi) * abs(midl - a[i].fi) + (long double)1.0 * a[i].se * a[i].se));
		}
		long double rig = 1e9;
		for (int i = 0; i < n; i++) {
			mini(rig, __builtin_sqrtl((long double)abs(midr - a[i].fi) * abs(midr - a[i].fi) + (long double)1.0 * a[i].se * a[i].se));
		}
		if (lef < rig) {
			l = midl;
			maxi(ans, lef);
		} else {
			maxi(ans, rig);
			r = midr;
		}
	}
	cout << setprecision(6) << fixed << ans;
}

int32_t main()  {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	// freopen(task".inp", "r", stdin);
	// freopen(task".out", "w", stdout);

	int T = 1;
	// cin >> T;
	for (int i = 1; i <= T; i++) {
		solve(i);
	}
return 0;
}
/*

*/

Subtask #1
0 / 4.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 802 ms 1664 KB Output is correct
2 Correct 747 ms 2100 KB Output is correct
3 Correct 761 ms 1920 KB Output is correct
4 Incorrect 914 ms 3028 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 896 ms 2632 KB Output is correct
2 Correct 900 ms 2496 KB Output is correct
3 Correct 911 ms 2112 KB Output is correct
4 Incorrect 901 ms 3044 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1083 ms 8436 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1045 ms 12400 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1072 ms 10104 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1024 ms 14848 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1075 ms 11780 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1010 ms 17424 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1069 ms 13464 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1012 ms 19732 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1055 ms 16704 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1018 ms 24644 KB Time limit exceeded
2 Halted 0 ms 0 KB -