oj.uz

Submission #678875

# Submission time Handle Problem Language Result Execution time Memory
678875 2023-01-06T20:04:18 Z scrge Mobile (BOI12_mobile) C++17
0 / 100
 267 ms 3552 KB 
#include <bits/stdc++.h>
using namespace std;

int n, l;
pair<double, double> base[100000];

bool check(double r){
	pair<double, double> seg[100000];
	for(int i = 0; i < n; i++){
		double x = base[i].first, y = base[i].second;
		if(r*r < y*y) continue;
		double d = sqrt(r*r-y*y);
		seg[i] = {max((double)0, x-d), min(x+d, (double)l)};
	}

	sort(seg, seg+n);
	
	double right = 0;	
	for(int i = 0; i < n; i++){
		if(seg[i].first > right) return true;
		right = max(right, seg[i].second);
	}
	return false;
}

int main(){
	cin >> n >> l;
	for(int i = 0; i < n; i++)
		cin >> base[i].first >> base[i].second;

	double l = 0, r = 2e9;
	while(l+1e-4 < r){
		double mid = (l+r)/2;
		if(check(mid)) l = mid;
		else r = mid;
	}

	cout << l << endl;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 76 ms 3456 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 107 ms 3552 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 69 ms 3460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 3552 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 73 ms 3524 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 3480 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 71 ms 3464 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 126 ms 3524 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 73 ms 3548 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 106 ms 3536 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -