제출 #488435

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
488435		s_jaskaran_s	Balloons (CEOI11_bal)	C++17	20 / 100	484 ms	8088 KiB

bal

#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin>>n;
    ld a[n];
    ld r[n];
    int p;
    for(int i=0;i<n;i++){
        cin>>a[i];
        ld l;
        cin>>l;
        if(i==0){
            r[i]=l;
        }
        else if(i==1){
            r[i]=min(l,((a[i]-a[i-1])*(a[i]-a[i-1]))/(4*r[i-1]));
            p=0;
        }
        else{
            r[i]=min(l,((a[i]-a[i-1])*(a[i]-a[i-1]))/(4*r[i-1]));
            r[i]=min(r[i],((a[i]-a[p])*(a[i]-a[p]))/(4*r[p]));
            if(((a[i]-a[i-1])*(a[i]-a[i-1]))/(4*r[i-1])<((a[i]-a[p])*(a[i]-a[p]))/(4*r[p])){
                p=i-1;
            }
        }
        cout<<fixed<<setprecision(3)<<r[i]<<endl;
    }
    
}    

• Subtask 1: 10 / 10
• Subtask 2: 10 / 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