제출 #1339540

#제출 시각아이디문제언어결과실행 시간메모리
1339540joze_plocnikBalloons (CEOI11_bal)C++20
50 / 100
2095 ms6612 KiB
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <iomanip>
#include <cmath>

#define int long long // vse ti je long long
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int,int>>
#define oopt cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
#define forn(i,n) for(int i = 0; i<n; i++)
#define all(x) (x).begin(), (x).end()
#define ld long double

using namespace std;


signed main() {  
    int n; cin >> n;
    vi v(n), mxr(n);
    forn(i,n){
        cin >> v[i] >> mxr[i];
    }
    vi stack; //indexi balonov
    vector<ld> r(n,-1);
    forn(i,n){ //pri vsakem pogledamu vse prejšnje
        ld novi_r = mxr[i];
        for(int j = 0; j<i; j++){
            ld mora_r = (v[i]-v[j])*(v[i]-v[j])/(4.0*r[j]);
            novi_r = min(mora_r, novi_r);  
        }
        r[i] = novi_r;
    }
    forn(i,n){
        cout << fixed << setprecision(3) << r[i] << "\n";
    }

}




#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...