oj.uz

답안 #998474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998474 2024-06-14T03:38:31 Z hippo123 Balloons (CEOI11_bal) C++17
10 / 100
 471 ms 11432 KB 
#include <bits/stdc++.h>
using namespace std;

#define pr pair<double, double>
#define ll long long
#define pb push_back
#define f first
#define s second
vector<double> x, r;
vector<pr> xr;

bool check(double mid, int bb, int be){
	
	bool judge=false;
	for (int i=bb; i<be; i++){
		double rr=(mid+r[xr[bb].s])*(mid+r[xr[bb].s]);
		
		double dist1=(mid-r[xr[bb].s])*(mid-r[xr[bb].s])+(x[be]-x[xr[bb].s])*(x[be]-x[xr[bb].s]);

		if(rr>=dist1){
			judge=true; break;
		}
	} 	
	return judge;
		
}
	

int main(){
	int n; cin>>n;
	x.resize(n); r.resize(n); xr.resize(n);
	for (int i=0; i<n; i++) {
		cin>>x[i]>>r[i];
		xr[i].f=x[i]+r[i]; xr[i].s=i; 
	}
	sort(xr.begin(), xr.end());
	vector<double> ans(n);
	for (int i=0; i<n; i++){
		if(i==0) {
			ans[i]=r[i]; 
			continue;
		}
		//
		pr node={x[i]-r[i], 0};
		int pos=lower_bound(xr.begin(), xr.begin()+n, node)-xr.begin(); // pos can only be less than or equal to i;

		if(pos==i) {ans[i]=r[i]; continue;}
		
		double lft=0; double rht=r[i]; 
		while(rht-lft>0.00001){
			double mid=lft+(rht-lft)/2;

			if(check(mid, pos, i)) {
				rht=mid;
			}
			else lft=mid;			
			
		}
		ans[i]=lft;
	}
	cout << fixed <<setprecision(3);
	for (int i=0; i<n; i++) cout<<ans[i]<<endl;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 6th numbers differ - expected: '21.0000000000', found: '15.7600000000', error = '5.2400000000'
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB 2 numbers

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 348 KB 3rd numbers differ - expected: '0.0420000000', found: '2.0830000000', error = '2.0410000000'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 348 KB 3rd numbers differ - expected: '121.0000000000', found: '120.0180000000', error = '0.9820000000'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 49 ms 1372 KB 3rd numbers differ - expected: '211.0000000000', found: '210.0110000000', error = '0.9890000000'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 124 ms 3280 KB 3rd numbers differ - expected: '15396.0000000000', found: '9489.3930000000', error = '5906.6070000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 252 ms 6228 KB 3rd numbers differ - expected: '7936.0000000000', found: '6084.6240000000', error = '1851.3760000000'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 310 ms 6936 KB 6th numbers differ - expected: '5053.0000000000', found: '5052.0000000000', error = '1.0000000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 374 ms 9040 KB 3rd numbers differ - expected: '1872.0000000000', found: '1871.0010000000', error = '0.9990000000'
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 471 ms 11432 KB 3rd numbers differ - expected: '2960.0000000000', found: '2959.0010000000', error = '0.9990000000'
2 Halted 0 ms 0 KB -