제출 #577062

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
577062		Benqt	Balloons (CEOI11_bal)	C++17	30 / 100	599 ms	10440 KiB

bal

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int INF = 1000000000;
const ll LINF = (ll) INF * (ll) INF;
const ld DINF = (ld) INF * (ld) INF;
static int MAXN = 200005;

int main() {
	int n;
	cin >> n;
	vector<pair<ld, ld>> arr(MAXN);
	for (int i=0; i<n; i++) {
		cin >> arr[i].first; //x coord
		cin >> arr[i].second; //radius
	}
	stack<pair<ld, ld>> q;

	for (int i=0; i<n; i++) {
		while (!q.empty()) {
			pair<ld, ld> top = q.top();
			ld h = arr[i].first - top.first;
			ld r = (h * h)/(4.0 * top.second);
			arr[i].second = min(arr[i].second, r);
			if (r >= top.second) {
				q.pop();
			} else {
				break;
			}
		}
		q.push(arr[i]);
	}

	cout << setprecision(20) << endl;
	for (int i=0; i<n; i++) {
		cout << arr[i].second << endl;
	}
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 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