oj.uz

Submission #312563

# Submission time Handle Problem Language Result Execution time Memory
312563 2020-10-13T17:36:15 Z fatemetmhr Balloons (CEOI11_bal) C++17
100 / 100
 232 ms 14328 KB 
#include<bits/stdc++.h>
#define sanastd using namespace std
sanastd;
 
const int MAXN = 1000 * 1000 + 10;
const long long INF = 1LL * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 10;
 
long long n, r[MAXN], x[MAXN];
long double ans[MAXN];
stack <int> balloon;
 
long double ssq (long double m)
{
  	long double lo = 0, hi = m + 1;
  	while(hi - lo > 0.0001){
      	long double mid = (hi + lo) / 2.0;
      	if(mid * mid > m) hi = mid;
      	else lo = mid;
    }
  	return lo;
}
bool check(int ind1, int ind2, double mid)
{
    long double d = (x[ind1] - x[ind2]) * (x[ind1] - x[ind2]) + (ans[ind2] - mid) * (ans[ind2] - mid);
    if(ssq(d) < mid + ans[ind2]) return 0;
    else return 1;
}
int main ()
{
    cout<<fixed<<setprecision(15);
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
 
    cin >> n >> x[0] >> r[0];
    balloon.push(0);
    ans[0] = r[0];
    cout << r[0] << endl;
    for(int i = 1; i < n; i++){
        cin >> x[i] >> r[i];
        ans[i] = r[i];
        while(!balloon.empty() and ans[balloon.top()] <= ans[i]){
            long double d = (x[i] - x[balloon.top()]) * (x[i] - x[balloon.top()]) / ( ans[balloon.top()] * 4.0);
            ans[i] = min(ans[i], d);
            if(ans[i] >= ans[balloon.top()]) balloon.pop();
        }
        if(!balloon.empty()){
            long double d = (x[i] - x[balloon.top()]) * (x[i] - x[balloon.top()]) / (ans[balloon.top()] * 4.0);
            ans[i] = min(ans[i], d);
        }
        balloon.push(i);
        cout << ans[i] << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3068 KB 50000 numbers
2 Correct 53 ms 3960 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 5732 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 6392 KB 115362 numbers
2 Correct 134 ms 8568 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 8440 KB 154271 numbers
2 Correct 194 ms 14328 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 10748 KB 200000 numbers
2 Correct 194 ms 14200 KB 199945 numbers