Submission #485096

#	Time	Username	Problem	Language	Result	Execution time	Memory
485096		LptN21	Balloons (CEOI11_bal)	C++14	100 / 100	281 ms	7680 KiB

bal

#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define PI acos(-1.0)
#define FF first
#define SS second
#define eps 1e-3
// vector
#define pb push_back
#define sz(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define lb lower_bound
#define ub upper_bound
// bit
#define CNTBIT(x) __builtin_popcount(x)
#define ODDBIT(x) __builtin_parity(x)
#define MASK(i) (1ll<<(i))
#define BIT(x, i) (((x)>>(i))&1)
#define SUBSET(big, small) (((big)&(small))==(small))
#define MINBIT(x) (x)&(-x)
// typedef
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> i3;
/* CODE BELOW */
const int N=200000+7, M=30+1, K=26+1;
const int MOD=998244353;
const int oo=1e9+7;

int n, m, k, t;

int x[N];
double r[N];

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    cin>>n;
    for(int i=1;i<=n;i++) {
        cin>>x[i]>>r[i];
    }

    #define sqr(x) 1LL*(x)*(x)
    stack<int> st;
    for(int j, i=1;i<=n;i++) {
        while(sz(st)) {
            j=st.top();
            double R=sqr(x[i]-x[j])/(4*r[j]);
            r[i]=min(r[i], R);
            if(r[j]<=r[i]) st.pop();
            else break;
        }
        st.push(i);
    }

    cout.precision(3);
    for(int i=1;i<=n;i++) {
        cout<<fixed<<r[i]<<"\n";
    }

    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special/edge cases (n=1?)
    - do smth instead of nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

• 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