제출 #484259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484259		Olympia	Balloons (CEOI11_bal)	C++17	10 / 100	179 ms	5092 KiB

bal

#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <set>
#include <iomanip>
#define ll long long
using namespace std;
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];
    }
    vector<int> indices = {0};
    for (int i = 1; i < n; i++) {
        int myMax = 0;
        while (!indices.empty()){
            int j = indices.front();
            double val = ((x[i] - x[j]) * (x[i] - x[j])) / (4.0 * r[j]);
            r[i] = min(r[i], val);
            if (r[j] >= myMax) {
                break;
            } else {
                indices.pop_back();
            }
        }
        indices.push_back(i);
    }
    for (double d: r) {
        cout << setprecision(20) << d << "\n";
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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