제출 #500985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500985		danielsuh	Balloons (CEOI11_bal)	C++17	10 / 100	136 ms	10692 KiB

bal

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define int int64_t

long double get_radius(int r_1, int x_1, int y_1, int x_2) {
	ll num = pow(r_1, 2) - pow(x_1, 2) + 2 * x_1 * x_2 - pow(x_2, 2) - pow(y_1, 2);
	ll den = 2 * (y_1 + r_1);
	return (long double) -num / den;
}

void solve() {
	cout << fixed << setprecision(3);
	int N; cin >> N;
	vector<pair<int, int>> A(N); for(auto &x : A) cin >> x.first >> x.second;
	vector<long double> ans(N);
	stack<pair<int, int>> st;
	for(int i = 0; i < N; i++) {
		long double r = A[i].second;
		while(!st.empty()) {
			int r1 = st.top().second, x1 = st.top().first;
			long double test = (long double) (x1 - A[i].first) * (x1 - A[i].first) / (4 * r1);
			r = min(r, test);
			if(r >= r1) {
				st.pop();
			}else {
				break;
			}
		}
		st.push(A[i]);
		ans[i] = r;
	}
	for(auto &x : ans) cout << x << "\n";
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int T = 1;
    //cin >> T;
    for(int i = 1; i <= T; ++i) {
        solve();
    }
}

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