제출 #1215578

#제출 시각아이디문제언어결과실행 시간메모리
1215578MalixBalloons (CEOI11_bal)C++20
100 / 100
121 ms1988 KiB
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) x.begin(),x.end()

ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int main() {   
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;cin>>n;
    stack<pair<double,double>> st;
    REP(i,0,n){
        double x,y;cin>>x>>y;
        double r=y;
        while(!st.empty()){
            auto [p,q]=st.top();
            r=min(r,((x-p)*(x-p))/(4*q));
            if(r>=q)st.pop();
            else break;
        }
        st.push({x,r});
        cout<<fixed<<setprecision(3)<<r<<"\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...