제출 #474147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
474147		BackNoob	Balloons (CEOI11_bal)	C++14	100 / 100	505 ms	10092 KiB

bal

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define mask(i) (1LL << (i))
#define task "name"
#define ull unsigned long long
using namespace std;
const ll mxN = 220797 + 7;
const ll inf = 1e9 + 277;
const ll mod = 2147483648;
const ll infll = 1e18 + 7;
const ll base = 307;
const double eps = 0.001;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}

struct cicrle{
	int x;
	double r;
} a[mxN];

double ans[mxN];

double dist(double x , double y , double u , double v)
{
	return (x - u) * (x - u) + (y - v) * (y - v);
}

 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("task.inp" , "r" , stdin);
   // freopen("task.out" , "w" , stdout);

    int n;
    cin >> n;
    for(int i = 1 ; i <= n ; i++) cin >> a[i].x >> a[i].r;

   	ans[1] = a[1].r;
   	stack<pair<double , double>> s;
   	s.push({a[1].x , a[1].r});
    for(int i = 2 ; i <= n ; i++) {
    	double R = a[i].r;
    	while((int) s.size() != 0) {
	    	double lo = 0 , hi = a[i].r;
	    	double x = s.top().fi;
	    	double r = s.top().se;
	    	for(int j = 1 ; j <= 100 ; j++) {
	    		double mid = (lo + hi) / 2;
	    		if(dist(x , r , a[i].x , mid) >= (r + mid) * (r + mid)) lo = mid;
	    		else hi = mid; 
	    	}
	    	R = min(R , lo);
	    	if(R >= s.top().se) s.pop();
		    else break;
	    }
	    ans[i] = R;
    	s.push({a[i].x , ans[i]});
     }

    for(int i = 1 ; i <= n ; i++) {
    	cout << fixed << setprecision(3) << ans[i] << 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