제출 #218318

#제출 시각아이디문제언어결과실행 시간메모리
218318ChanchoBalloons (CEOI11_bal)C++14
0 / 100
265 ms11000 KiB
#include <iostream>
#include <iomanip>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n; cin >> n;
    int pila[n];
    long double x[n];
    long double r[n];
    long double ans[n];
    for(int i=0;i<n;i++){
        cin >> x[i] >> r[i];
    }
    pila[0] =0;
    int index = 0;
    long double k;
    for(int i=0;i<n;i++){
        if(i==0){
            ans[0] = r[0];
        }
        else{
            while (index >= 0){
                k = min(r[i],((x[i]-x[pila[index]])/(4*ans[pila[index]]))*(x[i]-x[pila[index]]));
                if(k<r[index]){
                    break;
                }
                pila[index] = 0;
                index--;
            }
            ans[i] = k;
            pila[index+1] = i;
            index++;
        }
        cout << 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...