oj.uz

Submission #134410

# Submission time Handle Problem Language Result Execution time Memory
134410 2019-07-22T16:19:20 Z Milki Balloons (CEOI11_bal) C++14
100 / 100
 281 ms 11844 KB 
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)
#define TRACE(x) cerr << #x << " = " << x << endl

typedef long long ll;
typedef long double ld;
typedef pair<ld, ld> point;

const int MAXN = 2e5 + 5;
const ld eps = 1e-12;

int n;
ld x[MAXN], r[MAXN];
stack <point> stek;

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

  cin >> n;
  REP(i, n){
    cin >> x[i] >> r[i];
    ld radijus = r[i];

    while(sz(stek)){
      ld xx = stek.top().first - x[i];
      xx *= xx;
      radijus = min(radijus, ( xx ) / ((ld)4 * stek.top().second));

      if(radijus > stek.top().second - eps)
        stek.pop();
      else{
        cout << setprecision(3) << fixed << radijus << "\n";
        stek.push(point(x[i], radijus));
        break;
      }
    }
    if(!sz(stek)){
      cout << setprecision(3) << fixed << radijus << "\n";
      stek.push(point(x[i], radijus));
    }
  }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 1400 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 3420 KB 50000 numbers
2 Correct 67 ms 3320 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 6116 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 7000 KB 115362 numbers
2 Correct 155 ms 7164 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 8712 KB 154271 numbers
2 Correct 256 ms 11724 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 10204 KB 200000 numbers
2 Correct 257 ms 11844 KB 199945 numbers