답안 #88190 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
88190	2018-12-04T10:13:38 Z	JustInCase	Mobile (BOI12_mobile)	C++17	25 / 100	1000 ms	71276 KB

mobile

#include <bits/stdc++.h>

const int32_t MAX_N = 1e6;
const double EPS = 1e-6;

int32_t n, l;
std::pair< int32_t, int32_t > points[MAX_N + 5];

bool Check(long double r) {
	std::vector< std::pair< long double, bool > > events(2 * n);

	for(int32_t i = 0; i < n; i++) {
		if(r * r < (int64_t) points[i].second * points[i].second) {
			events[2 * i] = { -2.0, 0 };
			events[2 * i + 1] = { -1.0, 1 };
			continue;
		}

		long double x1 = points[i].first - sqrt(r * r - (int64_t) points[i].second * points[i].second);
		long double x2 = points[i].first + sqrt(r * r - (int64_t) points[i].second * points[i].second);

		events[2 * i] = { x1, 0 };
		events[2 * i + 1] = { x2, 1 };
	}

	std::sort(events.begin(), events.end());

	int32_t currCnt = 0;
	for(int32_t i = 0; i < 2 * n; i++) {
		if(events[i].first > 0 && currCnt == 0) {
			return false;
		}

		if(events[i].first > l) {
			break;
		}

		if(events[i].second == 0) {
			currCnt++;
		}
		else {
			currCnt--;
		}

		if(!(events[i].first < 0.0) && currCnt == 0) {
			return false;
		}
	}

	if(events.back().first < 0) {
		return false;
	}

	return true;
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);

	std::cin >> n >> l;

	for(int32_t i = 0; i < n; i++) {
		std::cin >> points[i].first >> points[i].second;
	}

	int64_t low = 1, high = 1e18;
	long double ans;
	while(low <= high) {
		int64_t mid = (low + high) / 2;

		if(Check(mid / 10000000.0)) {
			ans = mid / 10000000.0;
			high = mid - 1;
		}
		else {
			low = mid + 1;
		}
	}

	std::cout << std::fixed << std::setprecision(7);
	std::cout << ans << '\n';
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	55 ms	788 KB	Output is correct
2	Correct	26 ms	788 KB	Output is correct
3	Correct	23 ms	788 KB	Output is correct
4	Correct	24 ms	788 KB	Output is correct

Subtask #4
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	59 ms	908 KB	Output is correct
2	Correct	60 ms	984 KB	Output is correct
3	Correct	63 ms	984 KB	Output is correct
4	Correct	60 ms	1004 KB	Output is correct

Subtask #5
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	58 ms	1004 KB	Output is correct
2	Correct	60 ms	1004 KB	Output is correct
3	Correct	63 ms	1004 KB	Output is correct
4	Correct	58 ms	1004 KB	Output is correct

Subtask #6
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	62 ms	1060 KB	Output is correct
2	Correct	58 ms	1060 KB	Output is correct
3	Correct	61 ms	1060 KB	Output is correct
4	Correct	57 ms	1060 KB	Output is correct
5	Correct	60 ms	1060 KB	Output is correct

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

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

Subtask #21
0 / 5.0

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

답안 #88190

Compilation message