Submission #746304

# Submission time Handle Problem Language Result Execution time Memory
746304 2023-05-22T09:14:13 Z kr_2003 Balloons (CEOI11_bal) C++14
100 / 100
485 ms 14740 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double

double sq(double a) {
  return a * a;
}

signed main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);




// #ifndef ONLINE_JUDGE
//   freopen("cowland.in", "r", stdin);
//   freopen("cowland.out", "w", stdout);
// #endif
  int n; cin >> n;
  double x[n], r[n];
  double r_f[n];
  for (int i = 0; i < n; ++i)
  {
    cin >> x[i];
    cin >> r[i];
  }
  stack<int>st;
  for (int i = 0; i < n; ++i)
  {
    // if (st.size()) cout << st.top() << endl;
    while (st.size()) {
      double rad = sq(x[i] - x[st.top()]) / (4 * r_f[st.top()]);
      r[i] = min(r[i], rad);
      // cout << r[i] << endl;
      if (r[i] >= r_f[st.top()]) {
        st.pop();
        continue;
      } else break;
    }
    r_f[i] = r[i];
    st.push(i);

  }

  cout << fixed << setprecision(3);
  for (int i = 0; i < n; ++i)
  {
    cout << r_f[i] << endl;
  }



  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB 10 numbers
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB 2 numbers
# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB 505 numbers
# Verdict Execution time Memory Grader output
1 Correct 5 ms 444 KB 2000 numbers
# Verdict Execution time Memory Grader output
1 Correct 58 ms 1336 KB 20000 numbers
# Verdict Execution time Memory Grader output
1 Correct 124 ms 3148 KB 50000 numbers
2 Correct 118 ms 3896 KB 49912 numbers
# Verdict Execution time Memory Grader output
1 Correct 288 ms 5912 KB 100000 numbers
# Verdict Execution time Memory Grader output
1 Correct 274 ms 6760 KB 115362 numbers
2 Correct 270 ms 9036 KB 119971 numbers
# Verdict Execution time Memory Grader output
1 Correct 438 ms 8972 KB 154271 numbers
2 Correct 434 ms 14740 KB 200000 numbers
# Verdict Execution time Memory Grader output
1 Correct 474 ms 11256 KB 200000 numbers
2 Correct 485 ms 14712 KB 199945 numbers