Submission #974142

#	Time	Username	Problem	Language	Result	Execution time	Memory
974142		AksLolCoding	Balloons (CEOI11_bal)	C++17	100 / 100	143 ms	5596 KiB

bal

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

using ld = long double;
using ld2 = array<ld, 2>;

ld rad(ld2 prev, ld x) {
	return ((prev[0]-x)*(prev[0]-x)/(4*prev[1]));
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;

	// solve
	stack<ld2> check;
	while (n--) {
		ld x, r;
		cin >> x >> r;

		while (!check.empty()) {
			ld2 prev = check.top();
			ld to_prev = rad(prev, x);
			r = min(r, to_prev);
			if (r >= prev[1]) check.pop();
			else break;
		}

		check.push({x, r});

		printf("%.3Lf\n", r);
	}
}

• 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