Submission #464023

#TimeUsernameProblemLanguageResultExecution timeMemory
464023dutchBalloons (CEOI11_bal)C++17
100 / 100
228 ms8648 KiB
#include <bits/stdc++.h>
using namespace std;

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n; cin >> n;
	int x[n], st[n+1], *p = st;
	double y[n];

	for(int i=0; i<n; ++i){
		cin >> x[i] >> y[i];
		while(p != st){
			y[i] = min(y[i], pow(x[*p]-x[i], 2)/(4.0*y[*p]));
			if(y[*p] < y[i]) --p;
			else break;
		}
		*(++p) = i;
		cout << fixed << setprecision(4) << y[i] << '\n';
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...