oj.uz

Submission #88192

# Submission time Handle Problem Language Result Execution time Memory
88192 2018-12-04T10:22:17 Z JustInCase Mobile (BOI12_mobile) C++17
45 / 100
 1000 ms 75712 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);

	long double curr = 0;
	for(int32_t i = 0; i < n; i++) {
		if(r * r < (int64_t) points[i].second * points[i].second) {
			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);

		if(!(x1 > curr)) {
			curr = std::max(curr, x2);
		}
	}

	if(!(curr < l)) {
		return true;
	}
	else {
		return false;
	}
}

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 3 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 596 KB Output is correct

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 972 KB Output is correct
2 Correct 7 ms 972 KB Output is correct
3 Correct 7 ms 1100 KB Output is correct
4 Correct 7 ms 1100 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1100 KB Output is correct
2 Correct 7 ms 1100 KB Output is correct
3 Correct 7 ms 1100 KB Output is correct
4 Correct 6 ms 1132 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1132 KB Output is correct
2 Correct 7 ms 1132 KB Output is correct
3 Correct 7 ms 1132 KB Output is correct
4 Correct 6 ms 1132 KB Output is correct
5 Correct 7 ms 1132 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 6012 KB Output is correct
2 Correct 78 ms 6012 KB Output is correct
3 Correct 52 ms 6012 KB Output is correct
4 Correct 63 ms 6012 KB Output is correct
5 Correct 43 ms 6012 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 6140 KB Output is correct
2 Correct 63 ms 6140 KB Output is correct
3 Correct 70 ms 6292 KB Output is correct
4 Correct 66 ms 6292 KB Output is correct
5 Correct 72 ms 6720 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 6844 KB Output is correct
2 Correct 87 ms 6844 KB Output is correct
3 Correct 81 ms 6844 KB Output is correct
4 Correct 83 ms 7584 KB Output is correct
5 Correct 78 ms 7584 KB Output is correct

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 106 ms 7800 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 7800 KB Output is correct
2 Correct 106 ms 7800 KB Output is correct
3 Correct 94 ms 8860 KB Output is correct
4 Correct 82 ms 10688 KB Output is correct
5 Correct 85 ms 11980 KB Output is correct

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 555 ms 40352 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 584 ms 40352 KB Expected double, but "-nan" found
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1055 ms 47488 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 1073 ms 47488 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 1062 ms 54392 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 1036 ms 54572 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 1064 ms 61544 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 1020 ms 61544 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 1074 ms 75712 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 1006 ms 75712 KB Time limit exceeded
2 Halted 0 ms 0 KB -