제출 #1257511

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1257511		nikaa123	Balloons (CEOI11_bal)	C++20	30 / 100	114 ms	11088 KiB

bal

#include <bits/stdc++.h>
using namespace std;

#define double long double
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(), (x).end()
#define deb(x) cout << #x << "-" << x << endl

typedef char chr;
typedef string str;
typedef long long ll;
typedef vector<int> vii;
typedef pair<int, int> pii;

const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};
// const double PI = 2 * acos(0.0);

const int N = 2e5 + 5;

double n;
double x[N],mr[N];
double ans[N];
stack <pair<double,double>> st;

inline void test_case() {

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> mr[i];
        ans[i] = mr[i];
    }
    
    for (int i = 1; i <= n; i++) {
        while (!st.empty()) {
            auto &[ox,r] = st.top();
            double c = (ox - x[i]) * (ox - x[i]);
            ans[i] = min(ans[i], c * (1.0L / (4.0L * r)));
            if (ans[i] > r) st.pop(); else break;  
        }
        st.push({x[i],ans[i]});
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << endl;
    }

}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int T = 1;
    // cin >> T;
    while (T--) {
        test_case();
    }
    return 0;
}

• 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