제출 #1205286

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1205286		grimreaper	Balloons (CEOI11_bal)	C++20	30 / 100	126 ms	8492 KiB

bal

#ifndef _Alignof
#define _Alignof(x) __alignof__(x)
#endif

#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define vll vector<long long>
#define vpll vector< pair<long long int , long long int > > 
#define rep(i,x,a) for (long long i=x; i<a; i++)
#define si(x) (long long int)x.size()
#define pb push_back
#define ff first
#define ss second
#define lg2(x) (long long int)log2(x)
#define gap " "
#define nl '\n' 
#define all(x) (x).begin(),(x).end()
#define no cout<<"No\n"
#define yes cout<<"Yes\n"
#define vld vector<long double>

typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}
void print(){
    cout << '\n';
}
template<class T, class... Ts>
void print(const T& a, const Ts&... b){
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
template<class... T>
void input(T&... a){
    (cin >> ... >> a);
}

template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MOD=1e9+7;
const int N=1e6+10;;
const ll INF=1e16;
const long long int  LINF=LLONG_MAX;

/*------------------------------------*/

void solve(int tc = 0) 
{
    ll n;input(n);
    vector<long double> x(n),r(n);
    rep(i,0,n){
        input(x[i],r[i]);
    }
    auto rad = [&](long double x1,long double r2,long double x2){
        long double ans = (x1-x2)*(x1-x2);
        ans = ans/(4*r2);
        return ans;
    };
    stack<pair<long double,long double>> st;
    cout << fixed << setprecision(4)<< r[0] << nl;
    st.push({r[0],x[0]});
    for(int i=1;i<n;i++){
        long double curr = r[i];
        while(!st.empty() ){
            curr = min(curr,rad(x[i],st.top().first,st.top().second));
            if(rad(x[i],st.top().first,st.top().second) < st.top().first){
                break;
            }
            st.pop();
        }
        cout << fixed << setprecision(4)<< curr << nl;
        st.push({curr,x[i]});
    }
}

/*------------------------------------*/

int main()
{   
#ifndef ONLINE_JUDGE
    freopen("Error.txt","w",stderr);
#endif
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); cout.tie(nullptr);  
    ll tc=1;
    for(int i=0 ; i < tc ; i++)
    {
        solve(i);
    }
return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bal.cpp: In function 'int main()':
bal.cpp:112:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |     freopen("Error.txt","w",stderr);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

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