제출 #495885

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495885		keertan	Balloons (CEOI11_bal)	C++17	10 / 100	200 ms	7804 KiB

bal

#include <bits/stdc++.h>
using namespace std;
//#define int  int64_t
#define all(x) x.begin(), x.end()
#define all1(x) x.rbegin(), x.rend()
#define sz(x) (int)(x.size())
const int N = 1e5 + 5, mod = 1e9 + 7;
const int64_t N1=1e18;
const double eps=1e-11;
//#define double long double
void solve(){
  int n;
  cin>>n;
  vector<pair<double,double>> z(n);
  for (pair<double,double> &it:z){cin>>it.first>>it.second;}
  stack<pair<double,double>> s;
  for (int i=0;i<n;i++){
    bool chk=1;
    while(1){
      if (s.empty()){
        s.emplace(z[i].first,z[i].second);
        break;
      }
      else{
        double x=z[i].first,y=z[i].second,x1=s.top().first,y1=s.top().second;
        double r=1.0*(1.0*(x1-x)*(x1-x))/(4.0*y1);
        if (chk){chk=0,r=min(y,r);}
        if (r>=y1){s.pop();}
        else{
          s.emplace(z[i].first,r);
          break;
        }
      }
    }
    cout<<fixed<<setprecision(3)<<s.top().second<<"\n";
  }
}
int32_t main(){
  ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
  int tq = 1;
  //cin>>tq;
  for (;tq;tq--){solve();}
}

• 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