Submission #738120

#	Time	Username	Problem	Language	Result	Execution time	Memory
738120		Toxtaq	Balloons (CEOI11_bal)	C++17	10 / 100	2080 ms	4956 KiB

bal

#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<complex>
#include<map>
#include<iomanip>
using namespace std;
#define eps 1e-6
int n;
vector<pair<double, double>>balloons;
vector<double>res;
double dist(pair<double, double>a,pair<double,double>b){
	return sqrt((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));
}
bool check(double mid, int indx){
	for(int i = indx-1;i>=0;--i){
		if(dist({balloons[i].first, res[i]},{balloons[indx].first, mid})-(res[i]+mid)< eps)return true;
	}
	return false;
}
int main(){
	cin >> n;
	balloons.resize(n);
	for(int i = 0;i<n;++i){
		cin >> balloons[i].first >> balloons[i].second;
	}
	res.resize(n);
	res[0]=balloons[0].second;
	for(int i = 1;i<n;++i){
		double l = 1, r = balloons[i].second;
		while(r-l>eps){
			double mid = (l+r)/2;
			if(check(mid, i)){
				r = mid;
			}
			else l = mid;
		}
		res[i]=r;
	}
	for(double i : res)cout << fixed << setprecision(6)<< i << '\n';
}

• 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