제출 #313938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
313938		Parisa_Razzazi	Balloons (CEOI11_bal)	C++17	50 / 100	2089 ms	1904 KiB

bal

#include <iostream>
#include <iomanip>
using namespace std;
#include <math.h>
#include <vector>
vector <pair<int,long double>> v;

int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++){
		long double r;
		int x;
		cin >> x;
		cin >> r;
		long double fis;
		int j = v.size()-1;
		long double m = r;
		int ind  = 0;
		bool f = 0;
		while (j >= 0){
			long double o = x - v[j].first;
			fis = o * o / (4 * v[j].second); 
			if (fis < r){
				if (fis < m){
					m = fis;
					ind = v[j].first;
					f = 1;
				}
			}
			j--;
		}
		if (f){
			int p = v.size()-1;
			while (v.size() && v[p].first > ind){
				v.pop_back();
				p--;
			}
		}
		if (v.empty()){
			//cout << fixed << setprecision(3) << r << endl;
			printf("%.3Lf\n",r);
			v.push_back(make_pair(x,r));
		}
		else{
			//cout << fixed << setprecision(3) << m << endl;
			printf("%.3Lf\n",m);
			v.push_back(make_pair(x,m));
		}
	}
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10