제출 #1042173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042173		sssamui	Balloons (CEOI11_bal)	C++17	100 / 100	129 ms	11860 KiB

bal

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <stack>
#include <iomanip>
using namespace std;
using ld = long double;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;
	vector<ld> x(n), r(n);
	for (int i = 0; i < n; i++) cin >> x[i] >> r[i];

	stack<int> inds;
	for (int i = 0; i < n; i++)
	{
		bool cont = true;
		while (!inds.empty() && cont)
		{
			r[i] = fmin(r[i], (x[inds.top()] - x[i]) * (x[inds.top()] - x[i]) / (4 * r[inds.top()]));
			if (r[i] >= r[inds.top()]) inds.pop();
			else cont = false;
		}

		inds.push(i);
		cout << fixed << setprecision(3) << 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