Submission #1116618

#TimeUsernameProblemLanguageResultExecution timeMemory
1116618pemguimnBalloons (CEOI11_bal)C++14
30 / 100
2072 ms4936 KiB
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 2e5 + 5;
 
int n, x[N], r[N];
 
long double ans[N];
 
long double calc(int i, int j){
    long double lo = 0, hi = r[j];
    long double dx = abs(x[j] - x[i]);
    for(int t = 0; t < 100; t++){
        long double mid = (lo + hi) / 2;
        long double dy = abs(mid - ans[i]);
        if(dx * dx + dy * dy >= (mid + ans[i]) * (mid + ans[i])){
            lo = mid;
        } else{
            hi = mid;   
        }
    }
    return lo;
}
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
  
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> r[i];
        ans[i] = r[i];
    }
 
    stack<int> st;
    for(int i = 1; i <= n; i++){
        long double reach = r[i];
        for(int j = 1; j < i; j++){
          reach = min(reach, calc(j, i));
        }
        ans[i] = reach;
    }
 
 
    for(int i = 1; i <= n; i++)
        cout << setprecision(3) << fixed << ans[i] << "\n";
 
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...