Submission #597321

#	Time	Username	Problem	Language	Result	Execution time	Memory
597321		Zian_Jacobson	Balloons (CEOI11_bal)	C++17	30 / 100	282 ms	10456 KiB

bal

#include<bits/stdc++.h>
using namespace std;
#define cIO ios_base::sync_with_stdio(0);cin.tie(0)
#define fileIO(x) ifstream fin(string(x)+".in"); ofstream fout(string(x)+".out")
#define ll long long
#define ld long double
#define sz(x) (int) (x).size()
#define v vector
#define pb push_back
ll bal[200001][2];//[0]=x, [1]=r
ld ans[200001] = {};
int n;
ld get_rad(int b2, int b1)//b2 is the balloon we want to inflate, b1 is the balloon we want to intersect
{
	ld rad = (ld)(bal[b2][0] - bal[b1][0]);
	return rad * rad / (ld)ans[b1] / 4;
}
int main()
{
	cin >> n;
	for (int i = 0; i <= n-1; i++)
	{
		cin >> bal[i][0] >> bal[i][1];
	}
	stack<ll> stk;//stores the indices of the big bal we need to consider

	ans[0] = (ld)bal[0][1];
	stk.push(0);
	for (int i = 1; i <= n - 1; i++)
	{
		ld next_rad = min((ld)bal[i][1], get_rad(i, stk.top()));//if this value is less than the radius of the top balloon, we can continue
		while (!stk.empty()&&next_rad > ans[stk.top()])
		{
			stk.pop();
			if (stk.empty()) break;
			next_rad = min(next_rad, get_rad(i, stk.top()));
		}
		stk.push(i);
		ans[i] = next_rad;
	}
	for (int i = 0; i <= n - 1; i++) cout << ans[i] << "\n";
}

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