Submission #844290

#	Time	Username	Problem	Language	Result	Execution time	Memory
844290		AsandeiStefan	Balloons (CEOI11_bal)	C++17	10 / 100	234 ms	8032 KiB

bal

#include <iomanip>
#include <iostream>
#include <stack>
#include <vector>

struct sphere {
  double x, max_r;
};

int n;
std::vector<sphere> v;
std::stack<sphere> s;

int main() {
  std::cin >> n;

  v = std::vector<sphere>(n);
  for (int i = 0; i < n; i++) {
    std::cin >> v[i].x >> v[i].max_r;
  }

  for (int i = 0; i < n; i++) {
    double min_r = v[i].max_r;
    while (!s.empty()) {
      sphere prev = s.top();
      min_r = std::min(
          min_r, (((v[i].x - prev.x) * (v[i].x - prev.x)) / (4 * prev.max_r)));
      if (min_r >= prev.max_r)
        s.pop();
      else
        break;
    }
    s.push(v[i]);
    std::cout << std::fixed << std::setprecision(5) << min_r << '\n';
  }

  return 0;
}

• 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