oj.uz

Submission #88189

# Submission time Handle Problem Language Result Execution time Memory
88189 2018-12-04T10:13:04 Z JustInCase Mobile (BOI12_mobile) C++17
25 / 100
 1000 ms 71232 KB 
#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 / 100000.0)) {
			ans = mid / 100000.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

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 764 KB Output is correct
2 Correct 31 ms 896 KB Output is correct
3 Correct 24 ms 896 KB Output is correct
4 Correct 25 ms 896 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 904 KB Output is correct
2 Correct 60 ms 960 KB Output is correct
3 Correct 61 ms 960 KB Output is correct
4 Correct 62 ms 1032 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 1032 KB Output is correct
2 Correct 59 ms 1032 KB Output is correct
3 Correct 60 ms 1032 KB Output is correct
4 Correct 58 ms 1032 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1036 KB Output is correct
2 Correct 59 ms 1036 KB Output is correct
3 Correct 60 ms 1036 KB Output is correct
4 Correct 58 ms 1036 KB Output is correct
5 Correct 60 ms 1064 KB Output is correct

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1022 ms 43048 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 1049 ms 43048 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 1061 ms 50040 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 1012 ms 50040 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 1041 ms 57276 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 1070 ms 57276 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 1036 ms 71168 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 1081 ms 71232 KB Time limit exceeded
2 Halted 0 ms 0 KB -