제출 #1108145

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1108145		akamizane	Balloons (CEOI11_bal)	C++17	100 / 100	124 ms	7152 KiB

bal

#include<bits/stdc++.h>
 
using namespace std;
 

#define debug(...) 40

 
using ll = long long;
using pii = pair<int,int>;
using db = double;

#define el cout << '\n'
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
template <class T1, class T2>bool chmax(T1 &a, T2 b){return a < b ? a = b, 1 : 0;}
template <class T1, class T2>bool chmin(T1 &a, T2 b){return a > b ? a = b, 1 : 0;}
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int maxn = 2e5 + 5;

const ll mod = 1e9 + 7;

db calc(pair<db, db> b, db x){
  return (b.fi - x) * (b.fi - x) / (4 * b.se);
}

void solve(){
  int n;
  cin >> n;
  stack<pair<db, db>> s;
  vector<db> val(n);
  for (int i = 0; i < n; i++){
    double x, r;
    cin >> x >> r;
    double mi = r;
    while(s.size()){
      auto [x1, y1] = s.top();
      db val = calc({x1, y1}, x);
      chmin(mi, val);
      if (mi >= y1) s.pop();
      else break;
    }
    s.push({x, mi});
    val[i] = mi;
  }
  cout << setprecision(3) << fixed;
  for (auto v : val) cout << v << "\n";
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tests = 1;
  // cin >> tests;
  for (int _ = 1; _ <= tests; _++){
    cerr << "- Case #" << _ << ": \n";
    solve();
    el;
  }
  return 0;
}

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