oj.uz

Submission #88094

# Submission time Handle Problem Language Result Execution time Memory
88094 2018-12-03T19:44:40 Z JustInCase Mobile (BOI12_mobile) C++17
31 / 100
 1000 ms 81992 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());

	if(r == 5.0) {
		for(int32_t i = 0; i < 2 * n; i++) {
			std::cout << "     " << events[i].first << " " << events[i].second << '\n';
		}
	}

	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;
		}
	}

	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 = 1e12;
	long double ans;
	while(low <= high) {
		int64_t mid = (low + high) / 2;

		if(Check(mid / 10000.0)) {
			ans = mid / 10000.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 640 KB Output is correct
3 Correct 2 ms 704 KB Output is correct
4 Correct 2 ms 704 KB Output is correct

Subtask #2
4.0 / 4.0

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

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1076 KB Output is correct
2 Incorrect 19 ms 1128 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1252 KB Output is correct
2 Correct 40 ms 1352 KB Output is correct
3 Correct 42 ms 1380 KB Output is correct
4 Correct 40 ms 1496 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 1512 KB Output is correct
2 Correct 41 ms 1616 KB Output is correct
3 Correct 44 ms 1656 KB Output is correct
4 Correct 40 ms 1668 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 1744 KB Output is correct
2 Correct 41 ms 1792 KB Output is correct
3 Correct 43 ms 1792 KB Output is correct
4 Correct 41 ms 1860 KB Output is correct
5 Correct 41 ms 2008 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 638 ms 7644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 763 ms 7936 KB Output is correct
2 Correct 691 ms 8228 KB Output is correct
3 Correct 797 ms 10024 KB Output is correct
4 Correct 736 ms 11204 KB Output is correct
5 Correct 789 ms 13116 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 943 ms 13172 KB Output is correct
2 Correct 925 ms 13172 KB Output is correct
3 Correct 868 ms 13172 KB Output is correct
4 Correct 888 ms 15920 KB Output is correct
5 Correct 874 ms 16112 KB Output is correct

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 763 ms 16900 KB Output is correct
2 Execution timed out 1075 ms 16900 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1068 ms 45096 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 1080 ms 45096 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 1084 ms 52304 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 1081 ms 52304 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 1056 ms 61016 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 1069 ms 61016 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 1063 ms 67852 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 1057 ms 67952 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 81936 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 1054 ms 81992 KB Time limit exceeded
2 Halted 0 ms 0 KB -