Submission #884568

# Submission time Handle Problem Language Result Execution time Memory
884568 2023-12-07T16:57:20 Z bedupako Mobile (BOI12_mobile) C++17
0 / 100
1000 ms 57052 KB
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(),x.end()
typedef long long ll;
const double E = 1e-9;

bool good(vector<pair<double,double>>& x, double l){
	int n = x.size();
	sort(all(x));
	stack<pair<double,double>> s;
	for(int i = 0; i < n; i++){
		if(s.empty()){
			s.push(x[i]);
		}else if(s.top().second >= x[i].first){
			s.top().second = max(s.top().second,x[i].second);
		}else{
			s.push(x[i]);
		}
	}
	if((int)s.size() == 1){
		if(abs(s.top().first) <= E and abs(s.top().second-l) <= E){
			return true;
		}
	}
	return false;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n,l;
	cin >> n >> l;
	vector<double> x(n),y(n);
	for(int i = 0; i < n; i++){
		cin >> x[i] >> y[i];
	}
	double low = 0, high = 10;
	double ans = 0l;
	while(high - low >= E){
		double R = (low + high)/2;
		vector<pair<double,double>> ranges;
		for(int i = 0; i < n; i++){
			if(R < y[i]){
				continue;
			}else{
				double val = sqrt(R*R - y[i]*y[i]);
				ranges.emplace_back(max(0/1.0,(double)x[i]-val),
														min((double)l,(double)x[i]+val));
			}
		}
		if(good(ranges,l)){
			ans = R;
			high = R - E;
		}else{
			low = R + E;
		}
	}
	cout << fixed << setprecision(9) <<  ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 86 ms 4140 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 118 ms 6192 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 3416 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 3532 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 625 ms 29068 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 195 ms 16472 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 848 ms 41952 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 233 ms 19656 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 917 ms 47064 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 280 ms 22864 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1034 ms 50312 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 314 ms 26320 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 57052 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 383 ms 32596 KB Output isn't correct
2 Halted 0 ms 0 KB -