oj.uz

Submission #767296

# Submission time Handle Problem Language Result Execution time Memory
767296 2023-06-26T15:10:42 Z Alora Balloons (CEOI11_bal) C++17
100 / 100
 152 ms 7724 KB 
#include <bits/stdc++.h>
#define name "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define pb push_back
#define all(v) v.begin(), v.end()
#define maxn 200005
const int M = 1e9 + 7;
using namespace std;
int n, x[maxn], top, q[maxn];
double r[maxn];

void sub1(){
    fi(i, 2, n){
        fi(j, 1, i - 1){
            ll A = 1ll*(x[i] - x[j])*(x[i] - x[j]);
            double _r = A/(4*r[j]);
            r[i] = min(r[i], _r);
        }
    }
    fi(i, 1, n) cout << fixed << setprecision(3) << r[i] << '\n';
    exit(0);
}

double radius(int a, int b, double c){
    ll A = 1ll*(a - b)*(a - b);
    return A/(4*c);
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
  //  freopen(name".in", "r", stdin);
   // freopen(name".out", "w", stdout);
    cin >> n;
    fi(i, 1, n) cin >> x[i] >> r[i];
    if(n <= 2000) sub1();
    top = 1; q[1] = 1;
    fi(i, 2, n){
        while(top > 0){
            r[i] = min(r[i], radius(x[q[top]], x[i], r[q[top]]));
            if(r[i] >= r[q[top]])top--;
            else break;
        }
        q[++top] = i;
    }
    fi(i, 1, n) cout << fixed << setprecision(3) << r[i] << '\n';

}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 708 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1252 KB 50000 numbers
2 Correct 30 ms 1236 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 2380 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 2696 KB 115362 numbers
2 Correct 74 ms 4688 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 3412 KB 154271 numbers
2 Correct 128 ms 7724 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 4192 KB 200000 numbers
2 Correct 152 ms 7724 KB 199945 numbers