Submission #484244

#	Time	Username	Problem	Language	Result	Execution time	Memory
484244		Olympia	Balloons (CEOI11_bal)	C++17	30 / 100	2097 ms	6084 KiB

bal

#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <set>
#define ll long long
using namespace std;
struct interval_by_length {
    ll l, r;
    bool operator<(const interval_by_length& i1) const {
        if (i1.r - i1.l == r - l) {
            return (i1.l < l);
        }
        return (i1.r - i1.l < r - l);
    }
};
struct interval_by_left {
    ll l, r;
    bool operator<(const interval_by_left& i1) const {
        if (i1.l == l) {
            return (i1.r > r);
        }
        return (i1.l > l);
    }
};
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<double> x(n), r(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> r[i];
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < i; j++) {
            double val = ((x[i] - x[j]) * (x[i] - x[j]))/(4 * r[j]);
            r[i] = min(r[i], val);
        }
        //r[i] = rad;
    }
    for (double d: r) {
        cout << d << "\n";
    }
}

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