제출 #543198

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
543198		perchuts	Balloons (CEOI11_bal)	C++17	10 / 100	191 ms	7080 KiB

bal

#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define pb push_back
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ii = pair<int,int>;
using iii = tuple<int,int,int>;

const int inf = 2e9+1;
const int mod = 1e9+7;
const int maxn = 2e5+100;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }

double v[maxn], r[maxn], resp[maxn];

double compute(int i,int j){
    return min((v[i]-v[j])*(v[i]-v[j])/(4*resp[j]),r[i]);
}


int main(){_
    int n;cin>>n;
    for(int i=1;i<=n;++i)cin>>v[i]>>r[i];
    stack<int>st;
    for(int i=1;i<=n;++i){
        while(!st.empty()&&compute(i,st.top())>resp[st.top()])st.pop();
        resp[i] = (st.empty()?r[i]:compute(i,st.top()));
        st.push(i);
    }
    for(int i=1;i<=n;++i)cout<<fixed<<setprecision(3)<<resp[i]<<endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10