제출 #575144

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
575144		alexz1205	Balloons (CEOI11_bal)	C++14	100 / 100	556 ms	15244 KiB

bal

#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;

typedef long double lint;

lint dist(lint p1, lint p2, lint r1){
	return (p1-p2)*(p1-p2)/4/r1;
}

int main() {
	int n;
	cin >> n;
	lint pos[n], maxr[n], rad[n];
	for (int x = 0; x < n; x ++){
		cin >> pos[x] >> maxr[x];
	}
	vector<int> stack;
	for (int x = 0; x < n; x ++){
		rad[x] = maxr[x];
		while (!stack.empty()){
			int y = stack.back();
			rad[x] = min(dist(pos[y], pos[x], rad[y]), rad[x]);
			if (rad[x] > rad[y]){
				stack.pop_back();
			}else {
				break;
			}
		}
		stack.push_back(x);
	}
	for (int x = 0; x < n; x ++){
		cout << fixed << setprecision(3) << rad[x] << endl;
	}
	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