Submission #651563

#	Time	Username	Problem	Language	Result	Execution time	Memory
651563		Melika0gh	Balloons (CEOI11_bal)	C++17	100 / 100	343 ms	8524 KiB

bal

#include<bits/stdc++.h>
using namespace std;

const int maxn = 2e5+10;
double x[maxn], r[maxn];
vector<int> st;
int n;

void FindR(int ind)
{
	int i = st.back();
	double tmpr = (x[ind] - x[i]) / (double(4) * r[i]);
	tmpr *= (x[ind] - x[i]);
	//cout << ind << " , " << i << " , " << tmpr << endl;
	r[ind] = min(r[ind], tmpr);
}

int main()
{
	cin >> n;
	for(int i = 0; i < n; i++)
	{
		cin >> x[i] >> r[i];
	}
	
	for(int i = 0; i < n; i++)
	{
		while(!st.empty())
		{
			FindR(i);
			if(r[i] >= r[st.back()])
			{
				st.pop_back();
			}
			else
				break;
		}
		
		st.push_back(i);
	}
	
	for(int i = 0; i < n; i++)
	{
		cout.precision(3);
		cout << fixed << r[i] << '\n';
	}
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10