제출 #680247

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
680247		peijar	Balloons (CEOI11_bal)	C++17	10 / 100	193 ms	7552 KiB

bal

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

namespace std {
template <typename T> ostream &operator<<(ostream &out, const vector<T> &vec) {
  out << "[";
  for (int i = 0; i < (int)vec.size(); ++i) {
    out << vec[i];
    if (i + 1 < (int)vec.size())
      out << ", ";
  }
  return out << "]";
}
} // namespace std

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << H;
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

double sq(int x) { return x * x; }

struct Polynome {
  double a, b, c;

  bool operator<(Polynome other) const {
    return tuple(a, b, c) < tuple(other.a, other.b, other.c);
  };

  double eval(double x) const { return a * x * x + b * x + c; }
};

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int N;
  cin >> N;
  vector<int> x(N);
  vector<double> r(N);
  for (int i = 0; i < N; ++i) {
    cin >> x[i] >> r[i];
  }
  priority_queue<Polynome> polynomes;

  for (int i = 0; i < N; ++i) {
    while (polynomes.size() > 1) {
      auto &pol = polynomes.top();
      polynomes.pop();
      if (pol.eval(x[i]) >= polynomes.top().eval(x[i])) {
        dbg("ERASING", pol.a, pol.b, pol.c);
        dbg(pol.eval(x[2]));
        continue;
      }
      polynomes.push(pol);
      break;
    }
    if (!polynomes.empty()) {
      dbg(polynomes.top().eval(x[i]));
      r[i] = min(r[i], polynomes.top().eval(x[i]));
    }
    double inv = 1 / (4 * r[i]);
    double a = inv, b = -2 * x[i] * inv, c = sq(x[i]) * inv;
    dbg("ADDING", a, b, c);
    polynomes.push({a, b, c});
  }

  for (int i = 0; i < N; ++i) {
    cout << setprecision(15) << fixed << r[i] << '\n';
  }
}

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