oj.uz

Submission #853100

# Submission time Handle Problem Language Result Execution time Memory
853100 2023-09-23T12:21:39 Z Youssif_Elkadi Balloons (CEOI11_bal) C++17
100 / 100
 289 ms 3228 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 3, mod = 1e9 + 7, inf = 1e9 + 5;
double dist(double x1, double y1, double x2, double y2)
{
   return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
double gimr(double x1, double y1, double x2, double y2)
{
   double l = 0, r = y2, mid, ans = 0;
   for (int i = 0; i < 100; i++)
   {
      mid = (l + r) / 2;
      if (dist(x1, y1, x2, mid) >= (y1 + mid) * (y1 + mid))
         ans = max(ans, mid), l = mid;
      else
         r = mid;
   }
   return ans;
}
bool sa7be(double x1, double y1, double x2, double y2)
{
   return ((y1 + y2) * (y1 + y2) > dist(x1, y1, x2, y2));
}
int main()
{
   ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
   int n;
   cin >> n;
   stack<pair<double, double>> st;
   for (int i = 0; i < n; i++)
   {
      double x, r;
      cin >> x >> r;
      while (true)
      {
         if (st.size() && sa7be(st.top().first, st.top().second, x, r))
            r = min(r, gimr(st.top().first, st.top().second, x, r));
         if (st.size() && r > st.top().second)
            st.pop();
         else
            break;
      }
      cout << fixed << setprecision(3) << r << "\n";
      st.push({x, r});
   }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB 10 numbers

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB 2 numbers

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB 505 numbers

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 592 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 848 KB 50000 numbers
2 Correct 55 ms 1104 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 1340 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 1444 KB 115362 numbers
2 Correct 130 ms 2084 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 1856 KB 154271 numbers
2 Correct 217 ms 3228 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 2200 KB 200000 numbers
2 Correct 214 ms 3152 KB 199945 numbers