Submission #755222

#	Time	Username	Problem	Language	Result	Execution time	Memory
755222		farica	Balloons (CEOI11_bal)	C++14	20 / 100	612 ms	7608 KiB

bal

#include <bits/stdc++.h>
#define ll long long

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pi;

const int INF = 1e9;
const int MX = 5e5 + 23;
const int MOD = 1e9+7;
const int MAX_N = 1e6;
const int MAX_N2 = 1e5;
const int TWO_MOD_INV = 500000004;
const int M = 998244353;

bool intersect(int x1, int r1, int x2, int r2) {
    if(sqrt((x1-x2)*(x1-x2)+(r1-r2)*(r1-r2))<=(r1+r2)) return 1;
    return 0;
}

void solve() {
    int n;
    cin >> n;
    int x[n];
    long double r[n];
    stack<int>s;
    for(int i=0; i<n; ++i) {
        cin >> x[i] >> r[i];
        if(!i) {
            s.push(i);
            cout << fixed << setprecision(3) << r[i] << endl;
            continue;
        }
        while(!s.empty()) {
            int cur=s.top();
            r[i]=min(r[i],((x[i]-x[cur])*(x[i]-x[cur]))/(4*r[cur]));
            if(r[i]>r[cur]) s.pop();
            else break;
        }
        cout << fixed << setprecision(3) << r[i] << endl;
        s.push(i);
    }
}

signed main()
{

    //freopen("mootube.in","r",stdin);
    //freopen("mootube.out","w",stdout);

    int t=1;
    while(t--) solve();

    return 0;
}

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