제출 #703050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
703050		a_aguilo	Balloons (CEOI11_bal)	C++14	20 / 100	541 ms	9524 KiB

bal

#include<bits/stdc++.h>

using namespace std;

int n;

long double getRad(int d, long double r){
	long double result = (long double)(d*d)/(4*r);
	return result;
}

int main(){
	cin >> n;
	long double radius[n];
	int position[n];
	for(int i = 0; i < n; ++i) cin >> position[i] >> radius[i];
	vector<pair<int, long double>> MyStack;
	MyStack.reserve(n);
	MyStack.push_back({position[0], radius[0]});
	for(int i = 1; i < n; ++i){
		int lastIdx = MyStack.size()-1;
		radius[i] = min(radius[i], getRad(position[i]-MyStack[lastIdx].first, MyStack[lastIdx].second));
		while(lastIdx>= 0 and radius[i] > MyStack[lastIdx].second){
			MyStack.pop_back();
			lastIdx = MyStack.size()-1;
			if(lastIdx>= 0) radius[i] = min(radius[i], getRad(position[i]-MyStack[lastIdx].first, MyStack[lastIdx].second));
		}
		MyStack.push_back({position[i], radius[i]});
	}
	for(int i = 0; i < n; ++i){
		cout << radius[i] << endl;
	}
	return 0;
}

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