제출 #1304819

#제출 시각아이디문제언어결과실행 시간메모리
1304819neonglitchBalloons (CEOI11_bal)C++20
60 / 100
2096 ms8244 KiB
#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
using namespace std;
typedef long double ld;
typedef long double ll;
const int N=2e5+10;
ld x[N],r[N];
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	ld eps=1e-10;
	vector<int> q;
	for(int i=0;i<n;i++)
	{
		cin>>x[i]>>r[i];
		for(int&j:q)
		{
			ld p=((x[i]-x[j])/sqrtl(4*r[j]));
			r[i]=min(r[i],p*p);
		}
		while(q.size()>0 and r[q.back()]+eps<r[i])
		{
			q.pop_back();
		}
		q.push_back(i);
		cout<<fixed<<setprecision(3)<<r[i]<<endl;
	}
}
#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...