Submission #670280

#	Time	Username	Problem	Language	Result	Execution time	Memory
670280		RadicaI	Mobile (BOI12_mobile)	C++17	55 / 100	1084 ms	47132 KiB

mobile

#include <bits/stdc++.h>
using namespace std;
using ld = long double;
int main(){
	cout.precision(10);
	int n,siz; cin >> n>>siz;
	pair<ld, ld> stations[n];
	for(int i=0; i<n; i++) cin >> stations[i].first >> stations[i].second;
	ld l = 1; ld r = 2e9;
	while(r - l > 1e-3){
		ld m = (l+r)/2.0;
		set<pair<ld, int> > endp; ld store=0;
		for(int i=0; i<n; i++){
			if(abs(stations[i].second) <=m){
				ld ph = stations[i].first + sqrt(m*m-stations[i].second*stations[i].second);
				ld pl = stations[i].first - sqrt(m*m-stations[i].second*stations[i].second);
				if(pl<=store) store = max(store, ph);
			}
		}
		if(store>=siz) r=m;
		else l=m;
		
	}
	cout << l;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 0 / 5
• Subtask 11: 5 / 5
• Subtask 12: 0 / 5
• Subtask 13: 5 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 5 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5