Submission #447497

#	Time	Username	Problem	Language	Result	Execution time	Memory
447497		rieyuw	Balloons (CEOI11_bal)	C++17	100 / 100	264 ms	5828 KiB

bal

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <unordered_set>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <climits>
#include <queue>
#include <array>

using namespace std;

#define f first
#define s second
const int mxN = 1000;
const int INF = 1e9 + 7;
const int mod = 1e9 + 7;
/*Problem: */

void solve() {}

int main()
{
	ios::sync_with_stdio(0), cin.tie(0);
	//freopen("paintbarn.in", "r", stdin);
	//freopen("paintbarn.out", "w", stdout);	
	//int t = 1; cin >> t; while (t--) solve();

	int n; cin >> n;
	vector<int> x(n); vector<long double> dia(n);
	for (int i = 0; i < n; ++i)
		cin >> x[i] >> dia[i];

	stack<pair<int, long double>> stk;
	
	for (int i = 0; i < n; ++i)
	{
		while (!stk.empty())
		{
			long long x1 = stk.top().f;
			long double r1 = stk.top().s;
			dia[i] = min(dia[i], (x1 - x[i]) * (x1 - x[i]) / (4 * r1));
			if (dia[i] >= r1) stk.pop();
			else break;
		}
		stk.push({ x[i], dia[i] });
	}
	for (int i = 0; i < n; ++i)
		cout << fixed << setprecision(3) << dia[i] << "\n";
	
	return 0;
}

• 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