Submission #844278

#	Time	Username	Problem	Language	Result	Execution time	Memory
844278		AsandeiStefan	Balloons (CEOI11_bal)	C++17	100 / 100	487 ms	10836 KiB

bal

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;

const int M = 200005;
int n, top;
double x[M], r[M], q[M];

double Cal(int i, int j) {
  return (x[i] - x[j]) * (x[i] - x[j]) / (4 * r[j]);
}

int main() {
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> x[i] >> r[i];

    for(int i = 1; i <= n; i++) {
        while(top) {
            int j = q[top];
            r[i] = min(r[i], Cal(i,j));
            if(r[i] >= r[j]) top--;
            else break;
        }
        q[++top] = i;
    }
    for(int i = 1; i <= n; i++) cout << fixed << setprecision(5) << r[i] << endl;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10